/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_unwindbound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 05:14:40,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 05:14:40,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 05:14:40,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 05:14:40,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 05:14:40,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 05:14:40,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 05:14:40,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 05:14:40,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 05:14:40,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 05:14:40,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 05:14:40,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 05:14:40,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 05:14:40,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 05:14:40,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 05:14:40,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 05:14:40,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 05:14:40,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 05:14:40,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 05:14:40,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 05:14:40,991 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 05:14:40,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 05:14:40,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 05:14:40,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 05:14:40,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 05:14:41,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 05:14:41,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 05:14:41,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 05:14:41,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 05:14:41,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 05:14:41,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 05:14:41,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 05:14:41,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 05:14:41,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 05:14:41,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 05:14:41,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 05:14:41,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 05:14:41,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 05:14:41,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 05:14:41,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 05:14:41,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 05:14:41,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 05:14:41,007 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 05:14:41,014 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 05:14:41,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 05:14:41,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 05:14:41,016 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 05:14:41,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 05:14:41,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 05:14:41,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 05:14:41,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 05:14:41,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 05:14:41,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 05:14:41,017 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 05:14:41,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 05:14:41,017 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 05:14:41,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 05:14:41,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 05:14:41,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 05:14:41,018 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 05:14:41,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 05:14:41,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:14:41,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 05:14:41,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 05:14:41,018 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 05:14:41,018 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 05:14:41,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 05:14:41,018 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 05:14:41,018 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 05:14:41,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 05:14:41,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 05:14:41,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 05:14:41,213 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 05:14:41,213 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 05:14:41,214 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i [2022-04-08 05:14:41,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc737f4b0/10037c244d664fdbbb07cc89bdf78d69/FLAG5b1d31438 [2022-04-08 05:14:41,565 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 05:14:41,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i [2022-04-08 05:14:41,571 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc737f4b0/10037c244d664fdbbb07cc89bdf78d69/FLAG5b1d31438 [2022-04-08 05:14:42,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc737f4b0/10037c244d664fdbbb07cc89bdf78d69 [2022-04-08 05:14:42,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 05:14:42,015 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 05:14:42,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 05:14:42,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 05:14:42,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 05:14:42,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:14:42" (1/1) ... [2022-04-08 05:14:42,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5652c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:14:42, skipping insertion in model container [2022-04-08 05:14:42,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:14:42" (1/1) ... [2022-04-08 05:14:42,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 05:14:42,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 05:14:42,194 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_unwindbound2.i[950,963] [2022-04-08 05:14:42,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:14:42,221 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 05:14:42,229 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_unwindbound2.i[950,963] [2022-04-08 05:14:42,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:14:42,243 INFO L208 MainTranslator]: Completed translation [2022-04-08 05:14:42,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:14:42 WrapperNode [2022-04-08 05:14:42,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 05:14:42,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 05:14:42,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 05:14:42,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 05:14:42,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:14:42" (1/1) ... [2022-04-08 05:14:42,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:14:42" (1/1) ... [2022-04-08 05:14:42,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:14:42" (1/1) ... [2022-04-08 05:14:42,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:14:42" (1/1) ... [2022-04-08 05:14:42,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:14:42" (1/1) ... [2022-04-08 05:14:42,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:14:42" (1/1) ... [2022-04-08 05:14:42,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:14:42" (1/1) ... [2022-04-08 05:14:42,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 05:14:42,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 05:14:42,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 05:14:42,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 05:14:42,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:14:42" (1/1) ... [2022-04-08 05:14:42,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:14:42,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:14:42,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 05:14:42,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 05:14:42,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 05:14:42,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 05:14:42,336 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 05:14:42,337 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 05:14:42,337 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 05:14:42,337 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 05:14:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 05:14:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 05:14:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 05:14:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 05:14:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 05:14:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 05:14:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 05:14:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 05:14:42,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 05:14:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 05:14:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 05:14:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 05:14:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 05:14:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 05:14:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 05:14:42,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 05:14:42,396 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 05:14:42,398 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 05:14:42,529 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 05:14:42,535 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 05:14:42,535 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 05:14:42,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:14:42 BoogieIcfgContainer [2022-04-08 05:14:42,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 05:14:42,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 05:14:42,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 05:14:42,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 05:14:42,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 05:14:42" (1/3) ... [2022-04-08 05:14:42,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2246034b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:14:42, skipping insertion in model container [2022-04-08 05:14:42,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:14:42" (2/3) ... [2022-04-08 05:14:42,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2246034b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:14:42, skipping insertion in model container [2022-04-08 05:14:42,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:14:42" (3/3) ... [2022-04-08 05:14:42,545 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound2.i [2022-04-08 05:14:42,548 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 05:14:42,548 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 05:14:42,594 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 05:14:42,599 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 05:14:42,599 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 05:14:42,619 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-08 05:14:42,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 05:14:42,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:14:42,626 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:14:42,626 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:14:42,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:14:42,630 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-08 05:14:42,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:14:42,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [629719555] [2022-04-08 05:14:42,645 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:14:42,645 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 2 times [2022-04-08 05:14:42,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:14:42,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294755717] [2022-04-08 05:14:42,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:14:42,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:14:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:14:42,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 05:14:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:14:42,835 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-08 05:14:42,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 05:14:42,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-08 05:14:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 05:14:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:14:42,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:14:42,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:14:42,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:14:42,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-08 05:14:42,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 05:14:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:14:42,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:14:42,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:14:42,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:14:42,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-08 05:14:42,888 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-08 05:14:42,888 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-08 05:14:42,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 05:14:42,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-08 05:14:42,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-08 05:14:42,889 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-08 05:14:42,889 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-08 05:14:42,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:14:42,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:14:42,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:14:42,890 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-08 05:14:42,890 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-08 05:14:42,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-08 05:14:42,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-08 05:14:42,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 05:14:42,892 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-08 05:14:42,893 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-08 05:14:42,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-08 05:14:42,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-08 05:14:42,893 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-08 05:14:42,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-08 05:14:42,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-08 05:14:42,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-08 05:14:42,895 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-08 05:14:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:14:42,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294755717] [2022-04-08 05:14:42,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294755717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:14:42,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:14:42,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:14:42,898 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:14:42,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [629719555] [2022-04-08 05:14:42,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [629719555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:14:42,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:14:42,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:14:42,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573005297] [2022-04-08 05:14:42,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:14:42,902 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-08 05:14:42,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:14:42,908 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-08 05:14:42,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:14:42,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 05:14:42,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:14:42,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 05:14:42,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:14:42,974 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-08 05:14:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:43,134 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-08 05:14:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 05:14:43,134 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-08 05:14:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:14:43,136 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-08 05:14:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-08 05:14:43,146 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-08 05:14:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-08 05:14:43,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-08 05:14:43,241 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-08 05:14:43,250 INFO L225 Difference]: With dead ends: 60 [2022-04-08 05:14:43,250 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 05:14:43,253 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:14:43,256 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:14:43,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:14:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 05:14:43,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-08 05:14:43,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:14:43,283 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-08 05:14:43,283 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-08 05:14:43,283 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-08 05:14:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:43,287 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 05:14:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 05:14:43,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:43,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:43,287 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-08 05:14:43,288 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-08 05:14:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:43,290 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 05:14:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 05:14:43,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:43,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:43,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:14:43,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:14:43,295 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-08 05:14:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-08 05:14:43,299 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-08 05:14:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:14:43,299 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-08 05:14:43,299 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:14:43,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-08 05:14:43,334 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-08 05:14:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-08 05:14:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 05:14:43,335 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:14:43,336 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:14:43,336 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 05:14:43,336 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:14:43,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:14:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-08 05:14:43,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:14:43,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [763159964] [2022-04-08 05:14:43,338 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:14:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 2 times [2022-04-08 05:14:43,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:14:43,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651711435] [2022-04-08 05:14:43,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:14:43,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:14:43,355 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:14:43,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1127480457] [2022-04-08 05:14:43,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:14:43,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:14:43,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:14:43,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:14:43,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 05:14:43,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:14:43,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:14:43,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 05:14:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:14:43,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:14:43,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {286#true} is VALID [2022-04-08 05:14:43,633 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-08 05:14:43,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:43,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#(<= ~counter~0 0)} {286#true} #89#return; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:43,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#(<= ~counter~0 0)} call #t~ret5 := main(); {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:43,635 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-08 05:14:43,635 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-08 05:14:43,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:43,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:43,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:43,637 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #81#return; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:43,640 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-08 05:14:43,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:43,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:43,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:43,646 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #83#return; {294#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:43,646 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-08 05:14:43,647 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-08 05:14:43,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {343#(<= |main_#t~post3| 0)} assume !(#t~post3 < 2);havoc #t~post3; {287#false} is VALID [2022-04-08 05:14:43,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {287#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {287#false} is VALID [2022-04-08 05:14:43,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {287#false} assume !(#t~post4 < 2);havoc #t~post4; {287#false} is VALID [2022-04-08 05:14:43,648 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-08 05:14:43,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {287#false} ~cond := #in~cond; {287#false} is VALID [2022-04-08 05:14:43,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {287#false} assume 0 == ~cond; {287#false} is VALID [2022-04-08 05:14:43,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-08 05:14:43,650 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-08 05:14:43,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:14:43,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:14:43,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651711435] [2022-04-08 05:14:43,651 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:14:43,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127480457] [2022-04-08 05:14:43,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127480457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:14:43,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:14:43,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 05:14:43,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:14:43,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [763159964] [2022-04-08 05:14:43,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [763159964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:14:43,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:14:43,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 05:14:43,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828580950] [2022-04-08 05:14:43,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:14:43,653 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-08 05:14:43,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:14:43,653 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-08 05:14:43,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:14:43,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 05:14:43,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:14:43,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 05:14:43,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 05:14:43,695 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-08 05:14:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:43,766 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-08 05:14:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 05:14:43,767 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-08 05:14:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:14:43,768 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-08 05:14:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-08 05:14:43,775 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-08 05:14:43,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-08 05:14:43,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-08 05:14:43,814 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-08 05:14:43,816 INFO L225 Difference]: With dead ends: 42 [2022-04-08 05:14:43,816 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 05:14:43,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 05:14:43,820 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:14:43,823 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:14:43,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 05:14:43,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 05:14:43,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:14:43,844 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-08 05:14:43,845 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-08 05:14:43,846 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-08 05:14:43,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:43,857 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 05:14:43,857 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 05:14:43,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:43,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:43,860 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-08 05:14:43,860 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-08 05:14:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:43,861 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-08 05:14:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 05:14:43,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:43,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:43,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:14:43,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:14:43,862 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-08 05:14:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-08 05:14:43,863 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-08 05:14:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:14:43,864 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-08 05:14:43,864 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:14:43,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-08 05:14:43,892 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-08 05:14:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-08 05:14:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 05:14:43,893 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:14:43,893 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:14:43,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 05:14:44,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:14:44,104 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:14:44,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:14:44,105 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-08 05:14:44,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:14:44,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1008913320] [2022-04-08 05:14:44,105 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:14:44,105 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 2 times [2022-04-08 05:14:44,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:14:44,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376312623] [2022-04-08 05:14:44,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:14:44,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:14:44,129 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:14:44,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [249536801] [2022-04-08 05:14:44,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:14:44,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:14:44,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:14:44,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:14:44,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 05:14:44,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:14:44,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:14:44,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 05:14:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:14:44,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:14:44,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-08 05:14:44,361 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-08 05:14:44,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:44,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #89#return; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:44,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret5 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:44,363 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-08 05:14:44,363 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-08 05:14:44,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:44,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:44,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:44,365 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #81#return; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:44,365 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-08 05:14:44,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:44,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:44,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:44,367 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #83#return; {576#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:44,367 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-08 05:14:44,368 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-08 05:14:44,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {625#(<= ~counter~0 1)} assume !!(#t~post3 < 2);havoc #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-08 05:14:44,369 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-08 05:14:44,369 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-08 05:14:44,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {635#(<= |main_#t~post4| 1)} assume !(#t~post4 < 2);havoc #t~post4; {569#false} is VALID [2022-04-08 05:14:44,370 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-08 05:14:44,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-08 05:14:44,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-08 05:14:44,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-08 05:14:44,370 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-08 05:14:44,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:14:44,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:14:44,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376312623] [2022-04-08 05:14:44,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:14:44,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249536801] [2022-04-08 05:14:44,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249536801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:14:44,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:14:44,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:14:44,371 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:14:44,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1008913320] [2022-04-08 05:14:44,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1008913320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:14:44,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:14:44,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:14:44,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867920129] [2022-04-08 05:14:44,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:14:44,372 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-08 05:14:44,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:14:44,372 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-08 05:14:44,390 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-08 05:14:44,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:14:44,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:14:44,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:14:44,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:14:44,391 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-08 05:14:44,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:44,483 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 05:14:44,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:14:44,483 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-08 05:14:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:14:44,484 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-08 05:14:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-08 05:14:44,485 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-08 05:14:44,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-08 05:14:44,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-08 05:14:44,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:14:44,523 INFO L225 Difference]: With dead ends: 41 [2022-04-08 05:14:44,523 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 05:14:44,523 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:14:44,524 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:14:44,524 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:14:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 05:14:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-08 05:14:44,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:14:44,537 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-08 05:14:44,537 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-08 05:14:44,538 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-08 05:14:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:44,539 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-08 05:14:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 05:14:44,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:44,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:44,540 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-08 05:14:44,540 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-08 05:14:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:44,541 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-08 05:14:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 05:14:44,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:44,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:44,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:14:44,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:14:44,542 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-08 05:14:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-08 05:14:44,543 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-08 05:14:44,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:14:44,544 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-08 05:14:44,544 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:14:44,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 40 transitions. [2022-04-08 05:14:44,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:14:44,582 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-08 05:14:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 05:14:44,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:14:44,584 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:14:44,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 05:14:44,801 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 05:14:44,802 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:14:44,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:14:44,802 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-08 05:14:44,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:14:44,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1155000608] [2022-04-08 05:14:44,803 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:14:44,803 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 2 times [2022-04-08 05:14:44,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:14:44,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826124438] [2022-04-08 05:14:44,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:14:44,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:14:44,817 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:14:44,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980504005] [2022-04-08 05:14:44,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:14:44,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:14:44,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:14:44,819 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:14:44,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 05:14:44,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:14:44,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:14:44,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 05:14:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:14:44,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:14:45,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2022-04-08 05:14:45,341 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-08 05:14:45,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-08 05:14:45,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #89#return; {866#true} is VALID [2022-04-08 05:14:45,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret5 := main(); {866#true} is VALID [2022-04-08 05:14:45,342 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-08 05:14:45,342 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-08 05:14:45,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-08 05:14:45,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-08 05:14:45,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-08 05:14:45,342 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {866#true} {866#true} #81#return; {866#true} is VALID [2022-04-08 05:14:45,342 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-08 05:14:45,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-08 05:14:45,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-08 05:14:45,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-08 05:14:45,343 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {866#true} {866#true} #83#return; {866#true} is VALID [2022-04-08 05:14:45,343 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-08 05:14:45,344 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-08 05:14:45,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 2);havoc #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 05:14:45,345 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-08 05:14:45,345 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-08 05:14:45,346 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 < 2);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-08 05:14:45,346 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-08 05:14:45,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:14:45,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {867#false} is VALID [2022-04-08 05:14:45,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-08 05:14:45,348 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-08 05:14:45,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:14:45,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:14:45,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826124438] [2022-04-08 05:14:45,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:14:45,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980504005] [2022-04-08 05:14:45,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980504005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:14:45,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:14:45,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:14:45,349 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:14:45,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1155000608] [2022-04-08 05:14:45,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1155000608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:14:45,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:14:45,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:14:45,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332987234] [2022-04-08 05:14:45,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:14:45,350 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-08 05:14:45,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:14:45,350 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-08 05:14:45,366 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-08 05:14:45,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 05:14:45,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:14:45,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 05:14:45,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 05:14:45,367 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-08 05:14:47,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 05:14:49,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 05:14:49,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:49,802 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-08 05:14:49,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:14:49,803 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-08 05:14:49,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:14:49,803 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-08 05:14:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-08 05:14:49,804 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-08 05:14:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-08 05:14:49,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-08 05:14:49,857 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-08 05:14:49,858 INFO L225 Difference]: With dead ends: 50 [2022-04-08 05:14:49,858 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 05:14:49,859 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-08 05:14:49,859 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-08 05:14:49,860 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 104 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-04-08 05:14:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 05:14:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2022-04-08 05:14:49,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:14:49,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 43 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 05:14:49,892 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 43 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 05:14:49,892 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 43 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 05:14:49,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:49,894 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-08 05:14:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-08 05:14:49,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:49,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:49,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-04-08 05:14:49,894 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-04-08 05:14:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:49,896 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-08 05:14:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-08 05:14:49,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:49,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:49,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:14:49,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:14:49,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 05:14:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-08 05:14:49,898 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 26 [2022-04-08 05:14:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:14:49,898 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-08 05:14:49,898 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 05:14:49,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-08 05:14:49,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:14:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-08 05:14:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 05:14:49,946 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:14:49,946 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:14:49,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 05:14:50,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:14:50,160 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:14:50,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:14:50,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 1 times [2022-04-08 05:14:50,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:14:50,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [20774711] [2022-04-08 05:14:50,161 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:14:50,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 2 times [2022-04-08 05:14:50,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:14:50,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085627362] [2022-04-08 05:14:50,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:14:50,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:14:50,183 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:14:50,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [645670504] [2022-04-08 05:14:50,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:14:50,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:14:50,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:14:50,185 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:14:50,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 05:14:50,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:14:50,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:14:50,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 05:14:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:14:50,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:14:50,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {1229#true} call ULTIMATE.init(); {1229#true} is VALID [2022-04-08 05:14:50,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {1229#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#true} is VALID [2022-04-08 05:14:50,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {1229#true} assume true; {1229#true} is VALID [2022-04-08 05:14:50,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1229#true} {1229#true} #89#return; {1229#true} is VALID [2022-04-08 05:14:50,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {1229#true} call #t~ret5 := main(); {1229#true} is VALID [2022-04-08 05:14:50,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {1229#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; {1229#true} is VALID [2022-04-08 05:14:50,298 INFO L272 TraceCheckUtils]: 6: Hoare triple {1229#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1229#true} is VALID [2022-04-08 05:14:50,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#true} ~cond := #in~cond; {1229#true} is VALID [2022-04-08 05:14:50,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {1229#true} assume !(0 == ~cond); {1229#true} is VALID [2022-04-08 05:14:50,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {1229#true} assume true; {1229#true} is VALID [2022-04-08 05:14:50,298 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1229#true} {1229#true} #81#return; {1229#true} is VALID [2022-04-08 05:14:50,298 INFO L272 TraceCheckUtils]: 11: Hoare triple {1229#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1229#true} is VALID [2022-04-08 05:14:50,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {1229#true} ~cond := #in~cond; {1229#true} is VALID [2022-04-08 05:14:50,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {1229#true} assume !(0 == ~cond); {1229#true} is VALID [2022-04-08 05:14:50,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#true} assume true; {1229#true} is VALID [2022-04-08 05:14:50,299 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1229#true} {1229#true} #83#return; {1229#true} is VALID [2022-04-08 05:14:50,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1282#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 05:14:50,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {1282#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1282#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 05:14:50,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {1282#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 2);havoc #t~post3; {1282#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 05:14:50,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {1282#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1282#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 05:14:50,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {1282#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1282#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 05:14:50,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {1282#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 2);havoc #t~post4; {1282#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 05:14:50,317 INFO L272 TraceCheckUtils]: 22: Hoare triple {1282#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1229#true} is VALID [2022-04-08 05:14:50,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {1229#true} ~cond := #in~cond; {1229#true} is VALID [2022-04-08 05:14:50,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {1229#true} assume !(0 == ~cond); {1229#true} is VALID [2022-04-08 05:14:50,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {1229#true} assume true; {1229#true} is VALID [2022-04-08 05:14:50,318 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1229#true} {1282#(= main_~B~0 main_~b~0)} #85#return; {1282#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 05:14:50,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {1282#(= 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); {1230#false} is VALID [2022-04-08 05:14:50,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {1230#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1230#false} is VALID [2022-04-08 05:14:50,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {1230#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1230#false} is VALID [2022-04-08 05:14:50,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {1230#false} assume !(#t~post4 < 2);havoc #t~post4; {1230#false} is VALID [2022-04-08 05:14:50,319 INFO L272 TraceCheckUtils]: 31: Hoare triple {1230#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1230#false} is VALID [2022-04-08 05:14:50,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {1230#false} ~cond := #in~cond; {1230#false} is VALID [2022-04-08 05:14:50,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {1230#false} assume 0 == ~cond; {1230#false} is VALID [2022-04-08 05:14:50,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {1230#false} assume !false; {1230#false} is VALID [2022-04-08 05:14:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 05:14:50,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:14:50,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:14:50,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085627362] [2022-04-08 05:14:50,320 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:14:50,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645670504] [2022-04-08 05:14:50,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645670504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:14:50,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:14:50,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:14:50,321 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:14:50,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [20774711] [2022-04-08 05:14:50,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [20774711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:14:50,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:14:50,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:14:50,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691634098] [2022-04-08 05:14:50,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:14:50,321 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-08 05:14:50,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:14:50,322 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-08 05:14:50,340 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-08 05:14:50,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 05:14:50,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:14:50,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 05:14:50,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:14:50,341 INFO L87 Difference]: Start difference. First operand 43 states and 51 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-08 05:14:50,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:50,442 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2022-04-08 05:14:50,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 05:14:50,443 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-08 05:14:50,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:14:50,443 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-08 05:14:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-08 05:14:50,444 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-08 05:14:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-08 05:14:50,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-08 05:14:50,487 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-08 05:14:50,488 INFO L225 Difference]: With dead ends: 69 [2022-04-08 05:14:50,488 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 05:14:50,489 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:14:50,489 INFO L913 BasicCegarLoop]: 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-08 05:14:50,489 INFO L914 BasicCegarLoop]: 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-08 05:14:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 05:14:50,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 05:14:50,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:14:50,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 05:14:50,510 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 05:14:50,510 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 05:14:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:50,512 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-08 05:14:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-08 05:14:50,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:50,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:50,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-08 05:14:50,512 INFO L87 Difference]: Start difference. First operand has 44 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-08 05:14:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:50,514 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-08 05:14:50,514 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-08 05:14:50,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:50,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:50,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:14:50,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:14:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 05:14:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-08 05:14:50,516 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 35 [2022-04-08 05:14:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:14:50,516 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-08 05:14:50,516 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 05:14:50,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-08 05:14:50,564 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-08 05:14:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-08 05:14:50,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 05:14:50,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:14:50,565 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:14:50,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 05:14:50,765 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:14:50,766 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:14:50,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:14:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 1 times [2022-04-08 05:14:50,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:14:50,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [678382654] [2022-04-08 05:14:50,766 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:14:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 2 times [2022-04-08 05:14:50,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:14:50,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633569438] [2022-04-08 05:14:50,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:14:50,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:14:50,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:14:50,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806935248] [2022-04-08 05:14:50,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:14:50,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:14:50,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:14:50,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:14:50,785 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-08 05:14:50,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:14:50,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:14:50,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 05:14:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:14:50,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:14:51,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {1650#true} call ULTIMATE.init(); {1650#true} is VALID [2022-04-08 05:14:51,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {1650#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; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {1658#(<= ~counter~0 0)} assume true; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1658#(<= ~counter~0 0)} {1650#true} #89#return; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {1658#(<= ~counter~0 0)} call #t~ret5 := main(); {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {1658#(<= ~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; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,020 INFO L272 TraceCheckUtils]: 6: Hoare triple {1658#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {1658#(<= ~counter~0 0)} ~cond := #in~cond; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {1658#(<= ~counter~0 0)} assume !(0 == ~cond); {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {1658#(<= ~counter~0 0)} assume true; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,021 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1658#(<= ~counter~0 0)} {1658#(<= ~counter~0 0)} #81#return; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,021 INFO L272 TraceCheckUtils]: 11: Hoare triple {1658#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {1658#(<= ~counter~0 0)} ~cond := #in~cond; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {1658#(<= ~counter~0 0)} assume !(0 == ~cond); {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {1658#(<= ~counter~0 0)} assume true; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,023 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1658#(<= ~counter~0 0)} {1658#(<= ~counter~0 0)} #83#return; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {1658#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {1658#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1707#(<= ~counter~0 1)} is VALID [2022-04-08 05:14:51,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {1707#(<= ~counter~0 1)} assume !!(#t~post3 < 2);havoc #t~post3; {1707#(<= ~counter~0 1)} is VALID [2022-04-08 05:14:51,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {1707#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1707#(<= ~counter~0 1)} is VALID [2022-04-08 05:14:51,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {1707#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1717#(<= |main_#t~post3| 1)} is VALID [2022-04-08 05:14:51,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {1717#(<= |main_#t~post3| 1)} assume !(#t~post3 < 2);havoc #t~post3; {1651#false} is VALID [2022-04-08 05:14:51,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {1651#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1651#false} is VALID [2022-04-08 05:14:51,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {1651#false} assume !!(#t~post4 < 2);havoc #t~post4; {1651#false} is VALID [2022-04-08 05:14:51,026 INFO L272 TraceCheckUtils]: 24: Hoare triple {1651#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1651#false} is VALID [2022-04-08 05:14:51,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {1651#false} ~cond := #in~cond; {1651#false} is VALID [2022-04-08 05:14:51,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {1651#false} assume !(0 == ~cond); {1651#false} is VALID [2022-04-08 05:14:51,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {1651#false} assume true; {1651#false} is VALID [2022-04-08 05:14:51,027 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1651#false} {1651#false} #85#return; {1651#false} is VALID [2022-04-08 05:14:51,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {1651#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); {1651#false} is VALID [2022-04-08 05:14:51,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {1651#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1651#false} is VALID [2022-04-08 05:14:51,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {1651#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1651#false} is VALID [2022-04-08 05:14:51,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {1651#false} assume !(#t~post4 < 2);havoc #t~post4; {1651#false} is VALID [2022-04-08 05:14:51,027 INFO L272 TraceCheckUtils]: 33: Hoare triple {1651#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1651#false} is VALID [2022-04-08 05:14:51,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {1651#false} ~cond := #in~cond; {1651#false} is VALID [2022-04-08 05:14:51,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {1651#false} assume 0 == ~cond; {1651#false} is VALID [2022-04-08 05:14:51,028 INFO L290 TraceCheckUtils]: 36: Hoare triple {1651#false} assume !false; {1651#false} is VALID [2022-04-08 05:14:51,028 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-08 05:14:51,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:14:51,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {1651#false} assume !false; {1651#false} is VALID [2022-04-08 05:14:51,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {1651#false} assume 0 == ~cond; {1651#false} is VALID [2022-04-08 05:14:51,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {1651#false} ~cond := #in~cond; {1651#false} is VALID [2022-04-08 05:14:51,227 INFO L272 TraceCheckUtils]: 33: Hoare triple {1651#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1651#false} is VALID [2022-04-08 05:14:51,227 INFO L290 TraceCheckUtils]: 32: Hoare triple {1651#false} assume !(#t~post4 < 2);havoc #t~post4; {1651#false} is VALID [2022-04-08 05:14:51,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {1651#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1651#false} is VALID [2022-04-08 05:14:51,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {1651#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1651#false} is VALID [2022-04-08 05:14:51,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {1651#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); {1651#false} is VALID [2022-04-08 05:14:51,228 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1650#true} {1651#false} #85#return; {1651#false} is VALID [2022-04-08 05:14:51,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {1650#true} assume true; {1650#true} is VALID [2022-04-08 05:14:51,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {1650#true} assume !(0 == ~cond); {1650#true} is VALID [2022-04-08 05:14:51,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {1650#true} ~cond := #in~cond; {1650#true} is VALID [2022-04-08 05:14:51,228 INFO L272 TraceCheckUtils]: 24: Hoare triple {1651#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1650#true} is VALID [2022-04-08 05:14:51,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {1651#false} assume !!(#t~post4 < 2);havoc #t~post4; {1651#false} is VALID [2022-04-08 05:14:51,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {1651#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1651#false} is VALID [2022-04-08 05:14:51,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {1717#(<= |main_#t~post3| 1)} assume !(#t~post3 < 2);havoc #t~post3; {1651#false} is VALID [2022-04-08 05:14:51,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {1707#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1717#(<= |main_#t~post3| 1)} is VALID [2022-04-08 05:14:51,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {1707#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1707#(<= ~counter~0 1)} is VALID [2022-04-08 05:14:51,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {1707#(<= ~counter~0 1)} assume !!(#t~post3 < 2);havoc #t~post3; {1707#(<= ~counter~0 1)} is VALID [2022-04-08 05:14:51,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {1658#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1707#(<= ~counter~0 1)} is VALID [2022-04-08 05:14:51,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {1658#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,239 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1650#true} {1658#(<= ~counter~0 0)} #83#return; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {1650#true} assume true; {1650#true} is VALID [2022-04-08 05:14:51,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {1650#true} assume !(0 == ~cond); {1650#true} is VALID [2022-04-08 05:14:51,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {1650#true} ~cond := #in~cond; {1650#true} is VALID [2022-04-08 05:14:51,239 INFO L272 TraceCheckUtils]: 11: Hoare triple {1658#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1650#true} is VALID [2022-04-08 05:14:51,240 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1650#true} {1658#(<= ~counter~0 0)} #81#return; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {1650#true} assume true; {1650#true} is VALID [2022-04-08 05:14:51,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {1650#true} assume !(0 == ~cond); {1650#true} is VALID [2022-04-08 05:14:51,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {1650#true} ~cond := #in~cond; {1650#true} is VALID [2022-04-08 05:14:51,240 INFO L272 TraceCheckUtils]: 6: Hoare triple {1658#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1650#true} is VALID [2022-04-08 05:14:51,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {1658#(<= ~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; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {1658#(<= ~counter~0 0)} call #t~ret5 := main(); {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1658#(<= ~counter~0 0)} {1650#true} #89#return; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {1658#(<= ~counter~0 0)} assume true; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {1650#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; {1658#(<= ~counter~0 0)} is VALID [2022-04-08 05:14:51,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {1650#true} call ULTIMATE.init(); {1650#true} is VALID [2022-04-08 05:14:51,242 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-08 05:14:51,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:14:51,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633569438] [2022-04-08 05:14:51,242 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:14:51,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806935248] [2022-04-08 05:14:51,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806935248] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:14:51,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:14:51,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-08 05:14:51,243 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:14:51,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [678382654] [2022-04-08 05:14:51,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [678382654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:14:51,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:14:51,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:14:51,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045859726] [2022-04-08 05:14:51,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:14:51,244 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-08 05:14:51,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:14:51,244 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-08 05:14:51,266 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-08 05:14:51,266 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:14:51,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:14:51,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:14:51,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:14:51,267 INFO L87 Difference]: Start difference. First operand 44 states and 52 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-08 05:14:51,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:51,428 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-08 05:14:51,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:14:51,428 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-08 05:14:51,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:14:51,428 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-08 05:14:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-08 05:14:51,429 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-08 05:14:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-08 05:14:51,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-08 05:14:51,468 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-08 05:14:51,469 INFO L225 Difference]: With dead ends: 66 [2022-04-08 05:14:51,469 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 05:14:51,470 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 05:14:51,470 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 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-08 05:14:51,470 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:14:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 05:14:51,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 05:14:51,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:14:51,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 05:14:51,512 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 05:14:51,512 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 05:14:51,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:51,514 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-08 05:14:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-08 05:14:51,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:51,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:51,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-04-08 05:14:51,514 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-04-08 05:14:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:51,516 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-08 05:14:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-08 05:14:51,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:51,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:51,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:14:51,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:14:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 05:14:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-04-08 05:14:51,517 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 37 [2022-04-08 05:14:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:14:51,517 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-04-08 05:14:51,518 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 05:14:51,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 54 transitions. [2022-04-08 05:14:51,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:14:51,570 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-08 05:14:51,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 05:14:51,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:14:51,571 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:14:51,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 05:14:51,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:14:51,783 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:14:51,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:14:51,784 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 1 times [2022-04-08 05:14:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:14:51,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1822598422] [2022-04-08 05:14:51,784 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:14:51,784 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 2 times [2022-04-08 05:14:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:14:51,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15720784] [2022-04-08 05:14:51,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:14:51,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:14:51,814 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:14:51,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319172973] [2022-04-08 05:14:51,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:14:51,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:14:51,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:14:51,831 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-08 05:14:51,833 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-08 05:14:51,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:14:51,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:14:51,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 05:14:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:14:51,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:14:52,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {2194#true} call ULTIMATE.init(); {2194#true} is VALID [2022-04-08 05:14:52,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {2194#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; {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {2202#(<= 0 ~counter~0)} assume true; {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2202#(<= 0 ~counter~0)} {2194#true} #89#return; {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {2202#(<= 0 ~counter~0)} call #t~ret5 := main(); {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {2202#(<= 0 ~counter~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; {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,102 INFO L272 TraceCheckUtils]: 6: Hoare triple {2202#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {2202#(<= 0 ~counter~0)} ~cond := #in~cond; {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {2202#(<= 0 ~counter~0)} assume !(0 == ~cond); {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {2202#(<= 0 ~counter~0)} assume true; {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,104 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2202#(<= 0 ~counter~0)} {2202#(<= 0 ~counter~0)} #81#return; {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,104 INFO L272 TraceCheckUtils]: 11: Hoare triple {2202#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {2202#(<= 0 ~counter~0)} ~cond := #in~cond; {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {2202#(<= 0 ~counter~0)} assume !(0 == ~cond); {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {2202#(<= 0 ~counter~0)} assume true; {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,105 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2202#(<= 0 ~counter~0)} {2202#(<= 0 ~counter~0)} #83#return; {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {2202#(<= 0 ~counter~0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2202#(<= 0 ~counter~0)} is VALID [2022-04-08 05:14:52,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {2202#(<= 0 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2251#(<= 1 ~counter~0)} is VALID [2022-04-08 05:14:52,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {2251#(<= 1 ~counter~0)} assume !!(#t~post3 < 2);havoc #t~post3; {2251#(<= 1 ~counter~0)} is VALID [2022-04-08 05:14:52,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {2251#(<= 1 ~counter~0)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2251#(<= 1 ~counter~0)} is VALID [2022-04-08 05:14:52,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {2251#(<= 1 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2261#(<= 2 ~counter~0)} is VALID [2022-04-08 05:14:52,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {2261#(<= 2 ~counter~0)} assume !!(#t~post3 < 2);havoc #t~post3; {2261#(<= 2 ~counter~0)} is VALID [2022-04-08 05:14:52,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {2261#(<= 2 ~counter~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2261#(<= 2 ~counter~0)} is VALID [2022-04-08 05:14:52,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {2261#(<= 2 ~counter~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2271#(<= 2 |main_#t~post4|)} is VALID [2022-04-08 05:14:52,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {2271#(<= 2 |main_#t~post4|)} assume !!(#t~post4 < 2);havoc #t~post4; {2195#false} is VALID [2022-04-08 05:14:52,109 INFO L272 TraceCheckUtils]: 25: Hoare triple {2195#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2195#false} is VALID [2022-04-08 05:14:52,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {2195#false} ~cond := #in~cond; {2195#false} is VALID [2022-04-08 05:14:52,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {2195#false} assume !(0 == ~cond); {2195#false} is VALID [2022-04-08 05:14:52,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {2195#false} assume true; {2195#false} is VALID [2022-04-08 05:14:52,109 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2195#false} {2195#false} #85#return; {2195#false} is VALID [2022-04-08 05:14:52,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {2195#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); {2195#false} is VALID [2022-04-08 05:14:52,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {2195#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2195#false} is VALID [2022-04-08 05:14:52,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {2195#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2195#false} is VALID [2022-04-08 05:14:52,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {2195#false} assume !(#t~post4 < 2);havoc #t~post4; {2195#false} is VALID [2022-04-08 05:14:52,110 INFO L272 TraceCheckUtils]: 34: Hoare triple {2195#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2195#false} is VALID [2022-04-08 05:14:52,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {2195#false} ~cond := #in~cond; {2195#false} is VALID [2022-04-08 05:14:52,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {2195#false} assume 0 == ~cond; {2195#false} is VALID [2022-04-08 05:14:52,110 INFO L290 TraceCheckUtils]: 37: Hoare triple {2195#false} assume !false; {2195#false} is VALID [2022-04-08 05:14:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 05:14:52,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:14:52,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:14:52,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15720784] [2022-04-08 05:14:52,111 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:14:52,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319172973] [2022-04-08 05:14:52,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319172973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:14:52,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:14:52,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:14:52,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:14:52,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1822598422] [2022-04-08 05:14:52,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1822598422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:14:52,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:14:52,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:14:52,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508660325] [2022-04-08 05:14:52,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:14:52,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 38 [2022-04-08 05:14:52,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:14:52,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-08 05:14:52,150 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-08 05:14:52,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 05:14:52,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:14:52,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 05:14:52,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 05:14:52,151 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-08 05:14:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:52,243 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-08 05:14:52,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:14:52,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 38 [2022-04-08 05:14:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:14:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-08 05:14:52,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 05:14:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-08 05:14:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 05:14:52,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-08 05:14:52,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:14:52,274 INFO L225 Difference]: With dead ends: 48 [2022-04-08 05:14:52,274 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 05:14:52,275 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 05:14:52,275 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:14:52,275 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 50 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:14:52,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 05:14:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 05:14:52,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:14:52,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 05:14:52,276 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 05:14:52,276 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 05:14:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:52,276 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 05:14:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 05:14:52,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:52,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:52,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 05:14:52,276 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 05:14:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:14:52,276 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 05:14:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 05:14:52,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:52,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:14:52,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:14:52,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:14:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 05:14:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 05:14:52,277 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-04-08 05:14:52,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:14:52,277 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 05:14:52,277 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-08 05:14:52,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 05:14:52,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:14:52,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 05:14:52,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:14:52,279 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 05:14:52,301 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-08 05:14:52,487 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:14:52,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 05:14:52,963 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 05:14:52,963 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 05:14:52,963 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 05:14:52,963 INFO L885 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: true [2022-04-08 05:14:52,964 INFO L885 garLoopResultBuilder]: At program point L16-2(lines 15 17) the Hoare annotation is: true [2022-04-08 05:14:52,964 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-04-08 05:14:52,964 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 15 17) the Hoare annotation is: true [2022-04-08 05:14:52,964 INFO L878 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:52,964 INFO L878 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:52,964 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 26 52) the Hoare annotation is: true [2022-04-08 05:14:52,964 INFO L885 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: true [2022-04-08 05:14:52,964 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 26 52) the Hoare annotation is: true [2022-04-08 05:14:52,964 INFO L878 garLoopResultBuilder]: At program point L40(lines 40 49) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) .cse0 (= main_~B~0 main_~b~0) .cse1) (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 (<= 2 |main_#t~post4|)) (not (<= 0 |old(~counter~0)|)))) [2022-04-08 05:14:52,964 INFO L878 garLoopResultBuilder]: At program point L40-2(lines 40 49) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:52,964 INFO L878 garLoopResultBuilder]: At program point L36-1(lines 36 39) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and .cse0 (<= |main_#t~post3| 0) (<= 1 ~counter~0) (= main_~B~0 main_~b~0) .cse1) (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-08 05:14:52,964 INFO L878 garLoopResultBuilder]: At program point L36-3(lines 36 39) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (not (<= |old(~counter~0)| 0)) (and .cse0 (<= 0 ~counter~0) (= main_~B~0 main_~b~0) .cse1) (and .cse0 (<= 1 ~counter~0) .cse1) (not (<= 0 |old(~counter~0)|)))) [2022-04-08 05:14:52,964 INFO L878 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:52,964 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 26 52) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:52,964 INFO L878 garLoopResultBuilder]: At program point L45(lines 45 48) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:52,964 INFO L878 garLoopResultBuilder]: At program point L45-2(lines 26 52) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) .cse0 (= main_~B~0 main_~b~0) .cse1) (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-08 05:14:52,965 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (or (and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:52,965 INFO L878 garLoopResultBuilder]: At program point L41-1(lines 40 49) the Hoare annotation is: (or (and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-08 05:14:52,965 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (and .cse0 (<= 1 ~counter~0) (= main_~B~0 main_~b~0) .cse1) (not (<= 0 |old(~counter~0)|)))) [2022-04-08 05:14:52,965 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-08 05:14:52,965 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 05:14:52,965 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-08 05:14:52,965 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 05:14:52,965 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-08 05:14:52,965 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 05:14:52,965 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 05:14:52,965 INFO L878 garLoopResultBuilder]: At program point L19-2(lines 18 24) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 05:14:52,965 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-04-08 05:14:52,965 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 18 24) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 05:14:52,965 INFO L878 garLoopResultBuilder]: At program point L20(lines 20 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 05:14:52,965 INFO L878 garLoopResultBuilder]: At program point L19(lines 19 22) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 05:14:52,965 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 05:14:52,968 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2] [2022-04-08 05:14:52,969 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 05:14:52,971 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 05:14:52,971 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 05:14:52,974 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 05:14:53,004 INFO L163 areAnnotationChecker]: CFG has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 05:14:53,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 05:14:53 BoogieIcfgContainer [2022-04-08 05:14:53,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 05:14:53,012 INFO L158 Benchmark]: Toolchain (without parser) took 10997.05ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 121.9MB in the beginning and 95.6MB in the end (delta: 26.3MB). Peak memory consumption was 61.3MB. Max. memory is 8.0GB. [2022-04-08 05:14:53,012 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 05:14:53,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.97ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 121.5MB in the beginning and 183.3MB in the end (delta: -61.8MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-04-08 05:14:53,012 INFO L158 Benchmark]: Boogie Preprocessor took 36.87ms. Allocated memory is still 207.6MB. Free memory was 183.3MB in the beginning and 181.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 05:14:53,013 INFO L158 Benchmark]: RCFGBuilder took 255.00ms. Allocated memory is still 207.6MB. Free memory was 181.8MB in the beginning and 169.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 05:14:53,013 INFO L158 Benchmark]: TraceAbstraction took 10471.74ms. Allocated memory is still 207.6MB. Free memory was 169.2MB in the beginning and 95.6MB in the end (delta: 73.6MB). Peak memory consumption was 74.6MB. Max. memory is 8.0GB. [2022-04-08 05:14:53,014 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.97ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 121.5MB in the beginning and 183.3MB in the end (delta: -61.8MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.87ms. Allocated memory is still 207.6MB. Free memory was 183.3MB in the beginning and 181.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 255.00ms. Allocated memory is still 207.6MB. Free memory was 181.8MB in the beginning and 169.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10471.74ms. Allocated memory is still 207.6MB. Free memory was 169.2MB in the beginning and 95.6MB in the end (delta: 73.6MB). Peak memory consumption was 74.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 511 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 299 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 125 IncrementalHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 212 mSDtfsCounter, 125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 143 PreInvPairs, 192 NumberOfFragments, 393 HoareAnnotationTreeSize, 143 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 33 FomulaSimplificationsInter, 277 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((!(\old(counter) <= 0) || (((A == r && 0 <= counter) && B == b) && q == 0)) || ((A == r && 1 <= counter) && q == 0)) || !(0 <= \old(counter)) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-08 05:14:53,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...