/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:16:33,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:16:33,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:16:33,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:16:33,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:16:33,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:16:33,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:16:33,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:16:33,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:16:33,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:16:33,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:16:33,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:16:33,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:16:33,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:16:33,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:16:33,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:16:33,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:16:33,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:16:33,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:16:33,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:16:33,385 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:16:33,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:16:33,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:16:33,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:16:33,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:16:33,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:16:33,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:16:33,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:16:33,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:16:33,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:16:33,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:16:33,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:16:33,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:16:33,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:16:33,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:16:33,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:16:33,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:16:33,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:16:33,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:16:33,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:16:33,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:16:33,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:16:33,400 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 14:16:33,409 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:16:33,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:16:33,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:16:33,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:16:33,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:16:33,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:16:33,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:16:33,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:16:33,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:16:33,411 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:16:33,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:16:33,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:16:33,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:16:33,411 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:16:33,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:16:33,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:16:33,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:16:33,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:16:33,412 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:16:33,412 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:16:33,412 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:16:33,412 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:16:33,412 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 14:16:33,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:16:33,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:16:33,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:16:33,597 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:16:33,597 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:16:33,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound10.i [2022-04-15 14:16:33,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb8d8ec2e/c0b330f69e7c40769262c4ff37b6185b/FLAG8bad2168a [2022-04-15 14:16:33,995 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:16:33,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound10.i [2022-04-15 14:16:33,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb8d8ec2e/c0b330f69e7c40769262c4ff37b6185b/FLAG8bad2168a [2022-04-15 14:16:34,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb8d8ec2e/c0b330f69e7c40769262c4ff37b6185b [2022-04-15 14:16:34,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:16:34,432 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:16:34,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:16:34,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:16:34,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:16:34,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:16:34" (1/1) ... [2022-04-15 14:16:34,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a64ad51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:16:34, skipping insertion in model container [2022-04-15 14:16:34,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:16:34" (1/1) ... [2022-04-15 14:16:34,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:16:34,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:16:34,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound10.i[951,964] [2022-04-15 14:16:34,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:16:34,580 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:16:34,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound10.i[951,964] [2022-04-15 14:16:34,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:16:34,599 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:16:34,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:16:34 WrapperNode [2022-04-15 14:16:34,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:16:34,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:16:34,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:16:34,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:16:34,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:16:34" (1/1) ... [2022-04-15 14:16:34,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:16:34" (1/1) ... [2022-04-15 14:16:34,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:16:34" (1/1) ... [2022-04-15 14:16:34,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:16:34" (1/1) ... [2022-04-15 14:16:34,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:16:34" (1/1) ... [2022-04-15 14:16:34,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:16:34" (1/1) ... [2022-04-15 14:16:34,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:16:34" (1/1) ... [2022-04-15 14:16:34,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:16:34,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:16:34,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:16:34,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:16:34,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:16:34" (1/1) ... [2022-04-15 14:16:34,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:16:34,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:16:34,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 14:16:34,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 14:16:34,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:16:34,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:16:34,675 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:16:34,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:16:34,676 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:16:34,676 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:16:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:16:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:16:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 14:16:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 14:16:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:16:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:16:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 14:16:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:16:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:16:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:16:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:16:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:16:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:16:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:16:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:16:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:16:34,737 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:16:34,738 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:16:34,897 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:16:34,907 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:16:34,908 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:16:34,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:16:34 BoogieIcfgContainer [2022-04-15 14:16:34,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:16:34,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:16:34,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:16:34,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:16:34,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:16:34" (1/3) ... [2022-04-15 14:16:34,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a30175e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:16:34, skipping insertion in model container [2022-04-15 14:16:34,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:16:34" (2/3) ... [2022-04-15 14:16:34,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a30175e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:16:34, skipping insertion in model container [2022-04-15 14:16:34,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:16:34" (3/3) ... [2022-04-15 14:16:34,917 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound10.i [2022-04-15 14:16:34,920 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:16:34,920 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:16:34,955 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:16:34,962 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 14:16:34,962 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:16:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:16:34,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 14:16:34,987 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:16:34,988 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:16:34,988 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:16:34,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:16:34,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 1 times [2022-04-15 14:16:34,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:34,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [296420485] [2022-04-15 14:16:35,006 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:16:35,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 2 times [2022-04-15 14:16:35,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:16:35,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655766472] [2022-04-15 14:16:35,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:16:35,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:16:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:16:35,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:16:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:16:35,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33#true} is VALID [2022-04-15 14:16:35,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 14:16:35,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-15 14:16:35,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:16:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:16:35,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-15 14:16:35,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-15 14:16:35,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-15 14:16:35,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-15 14:16:35,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:16:35,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {33#true} is VALID [2022-04-15 14:16:35,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 14:16:35,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-15 14:16:35,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2022-04-15 14:16:35,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {33#true} is VALID [2022-04-15 14:16:35,180 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {33#true} is VALID [2022-04-15 14:16:35,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-15 14:16:35,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-15 14:16:35,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-15 14:16:35,181 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-15 14:16:35,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {34#false} is VALID [2022-04-15 14:16:35,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-15 14:16:35,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-15 14:16:35,181 INFO L272 TraceCheckUtils]: 14: Hoare triple {34#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {34#false} is VALID [2022-04-15 14:16:35,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-15 14:16:35,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-15 14:16:35,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-15 14:16:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 14:16:35,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:16:35,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655766472] [2022-04-15 14:16:35,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655766472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:16:35,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:16:35,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:16:35,185 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:16:35,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [296420485] [2022-04-15 14:16:35,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [296420485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:16:35,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:16:35,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:16:35,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020854361] [2022-04-15 14:16:35,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:16:35,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 14:16:35,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:16:35,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:16:35,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:35,210 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:16:35,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:35,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:16:35,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:16:35,224 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:16:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:35,320 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-15 14:16:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:16:35,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 14:16:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:16:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:16:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 14:16:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:16:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-15 14:16:35,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-15 14:16:35,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:35,414 INFO L225 Difference]: With dead ends: 51 [2022-04-15 14:16:35,414 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 14:16:35,416 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:16:35,420 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:16:35,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:16:35,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 14:16:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 14:16:35,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:16:35,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 14:16:35,453 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 14:16:35,454 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 14:16:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:35,461 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 14:16:35,462 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 14:16:35,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:35,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:35,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 14:16:35,463 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 14:16:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:35,469 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 14:16:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 14:16:35,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:35,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:35,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:16:35,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:16:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 14:16:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-15 14:16:35,472 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-15 14:16:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:16:35,472 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-15 14:16:35,472 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:16:35,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-15 14:16:35,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 14:16:35,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 14:16:35,502 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:16:35,503 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:16:35,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:16:35,503 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:16:35,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:16:35,504 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 1 times [2022-04-15 14:16:35,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:35,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1636599395] [2022-04-15 14:16:35,507 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:16:35,507 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 2 times [2022-04-15 14:16:35,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:16:35,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857840396] [2022-04-15 14:16:35,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:16:35,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:16:35,538 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:16:35,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690254294] [2022-04-15 14:16:35,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:16:35,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:16:35,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:16:35,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:16:35,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 14:16:35,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:16:35,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:16:35,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 14:16:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:16:35,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:16:35,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2022-04-15 14:16:35,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {247#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {247#true} is VALID [2022-04-15 14:16:35,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#true} assume true; {247#true} is VALID [2022-04-15 14:16:35,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {247#true} {247#true} #84#return; {247#true} is VALID [2022-04-15 14:16:35,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {247#true} call #t~ret2 := main(); {247#true} is VALID [2022-04-15 14:16:35,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {247#true} is VALID [2022-04-15 14:16:35,910 INFO L272 TraceCheckUtils]: 6: Hoare triple {247#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {247#true} is VALID [2022-04-15 14:16:35,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {247#true} ~cond := #in~cond; {247#true} is VALID [2022-04-15 14:16:35,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#true} assume !(0 == ~cond); {247#true} is VALID [2022-04-15 14:16:35,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {247#true} assume true; {247#true} is VALID [2022-04-15 14:16:35,911 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {247#true} {247#true} #78#return; {247#true} is VALID [2022-04-15 14:16:35,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {247#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:16:35,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:16:35,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {285#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {292#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:16:35,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {292#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:16:35,916 INFO L272 TraceCheckUtils]: 15: Hoare triple {292#(and (= main_~b~0 1) (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)); {299#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:16:35,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {299#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {303#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:16:35,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {303#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {248#false} is VALID [2022-04-15 14:16:35,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {248#false} assume !false; {248#false} is VALID [2022-04-15 14:16:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 14:16:35,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:16:35,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:16:35,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857840396] [2022-04-15 14:16:35,918 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:16:35,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690254294] [2022-04-15 14:16:35,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690254294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:16:35,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:16:35,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:16:35,919 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:16:35,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1636599395] [2022-04-15 14:16:35,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1636599395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:16:35,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:16:35,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:16:35,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214195862] [2022-04-15 14:16:35,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:16:35,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-15 14:16:35,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:16:35,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:16:35,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:35,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 14:16:35,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:35,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 14:16:35,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 14:16:35,945 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:16:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:36,113 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 14:16:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:16:36,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-15 14:16:36,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:16:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:16:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 14:16:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:16:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 14:16:36,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-15 14:16:36,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:36,182 INFO L225 Difference]: With dead ends: 37 [2022-04-15 14:16:36,182 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 14:16:36,183 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 14:16:36,185 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:16:36,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:16:36,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 14:16:36,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 14:16:36,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:16:36,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:16:36,206 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:16:36,208 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:16:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:36,212 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 14:16:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 14:16:36,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:36,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:36,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 14:16:36,213 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 14:16:36,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:36,215 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 14:16:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 14:16:36,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:36,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:36,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:16:36,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:16:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:16:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-15 14:16:36,217 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2022-04-15 14:16:36,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:16:36,217 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-15 14:16:36,218 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:16:36,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-15 14:16:36,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 14:16:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 14:16:36,259 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:16:36,259 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:16:36,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 14:16:36,476 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:16:36,476 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:16:36,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:16:36,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 1 times [2022-04-15 14:16:36,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:36,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855999172] [2022-04-15 14:16:36,535 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 14:16:36,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2069278597, now seen corresponding path program 1 times [2022-04-15 14:16:36,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:16:36,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088944397] [2022-04-15 14:16:36,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:16:36,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:16:36,547 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:16:36,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1825697746] [2022-04-15 14:16:36,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:16:36,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:16:36,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:16:36,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:16:36,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 14:16:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:16:36,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 14:16:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:16:36,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:16:36,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {521#true} call ULTIMATE.init(); {521#true} is VALID [2022-04-15 14:16:36,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {521#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {521#true} is VALID [2022-04-15 14:16:36,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {521#true} assume true; {521#true} is VALID [2022-04-15 14:16:36,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {521#true} {521#true} #84#return; {521#true} is VALID [2022-04-15 14:16:36,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {521#true} call #t~ret2 := main(); {521#true} is VALID [2022-04-15 14:16:36,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {521#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {521#true} is VALID [2022-04-15 14:16:36,816 INFO L272 TraceCheckUtils]: 6: Hoare triple {521#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {521#true} is VALID [2022-04-15 14:16:36,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {521#true} ~cond := #in~cond; {547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:16:36,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:16:36,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {551#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:16:36,822 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {551#(not (= |assume_abort_if_not_#in~cond| 0))} {521#true} #78#return; {558#(<= (mod main_~A~0 4294967296) 10)} is VALID [2022-04-15 14:16:36,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {558#(<= (mod main_~A~0 4294967296) 10)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-15 14:16:36,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} [88] L34-2-->L35_primed: Formula: (or (= v_main_~r~0_In_1 v_main_~r~0_In_1) (and (= v_main_~r~0_In_1 0) (= (mod v_main_~b~0_Out_2 2) 0) (<= (mod (div (- v_main_~b~0_Out_2) (- 2)) 4294967296) (mod v_main_~r~0_In_1 4294967296)))) InVars {main_~r~0=v_main_~r~0_In_1} OutVars{main_~b~0=v_main_~b~0_Out_2, main_~r~0=v_main_~r~0_In_1} AuxVars[] AssignedVars[main_~b~0] {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-15 14:16:36,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} [87] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-15 14:16:36,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-15 14:16:36,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !false; {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-15 14:16:36,825 INFO L272 TraceCheckUtils]: 16: Hoare triple {562#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {578#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:16:36,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {578#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {582#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:16:36,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {582#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {522#false} is VALID [2022-04-15 14:16:36,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {522#false} assume !false; {522#false} is VALID [2022-04-15 14:16:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 14:16:36,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:16:36,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:16:36,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088944397] [2022-04-15 14:16:36,827 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:16:36,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825697746] [2022-04-15 14:16:36,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825697746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:16:36,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:16:36,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:16:36,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:16:36,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1855999172] [2022-04-15 14:16:36,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1855999172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:16:36,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:16:36,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 14:16:36,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852330509] [2022-04-15 14:16:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:16:36,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 14:16:36,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:16:36,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:16:36,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:36,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 14:16:36,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:36,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 14:16:36,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:16:36,879 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:16:39,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:16:41,287 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:16:43,424 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:16:43,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:43,672 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-15 14:16:43,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 14:16:43,672 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-15 14:16:43,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:16:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:16:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 14:16:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:16:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 14:16:43,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-15 14:16:43,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:43,740 INFO L225 Difference]: With dead ends: 49 [2022-04-15 14:16:43,740 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 14:16:43,740 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 14:16:43,741 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 14:16:43,741 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 106 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 3 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 14:16:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 14:16:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2022-04-15 14:16:43,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:16:43,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:16:43,771 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:16:43,772 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:16:43,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:43,780 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 14:16:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 14:16:43,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:43,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:43,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-04-15 14:16:43,781 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-04-15 14:16:43,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:43,782 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 14:16:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 14:16:43,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:43,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:43,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:16:43,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:16:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:16:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-15 14:16:43,784 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2022-04-15 14:16:43,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:16:43,784 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-15 14:16:43,784 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:16:43,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-15 14:16:43,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 14:16:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 14:16:43,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:16:43,833 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:16:43,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 14:16:44,038 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 14:16:44,039 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:16:44,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:16:44,040 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 1 times [2022-04-15 14:16:44,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:44,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1285855290] [2022-04-15 14:16:44,040 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 14:16:44,040 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 2 times [2022-04-15 14:16:44,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:16:44,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383729035] [2022-04-15 14:16:44,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:16:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:16:44,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:16:44,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1336778608] [2022-04-15 14:16:44,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:16:44,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:16:44,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:16:44,055 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:16:44,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 14:16:44,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:16:44,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:16:44,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 14:16:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:16:44,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:16:44,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {847#true} call ULTIMATE.init(); {847#true} is VALID [2022-04-15 14:16:44,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {847#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {847#true} is VALID [2022-04-15 14:16:44,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {847#true} assume true; {847#true} is VALID [2022-04-15 14:16:44,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {847#true} {847#true} #84#return; {847#true} is VALID [2022-04-15 14:16:44,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {847#true} call #t~ret2 := main(); {847#true} is VALID [2022-04-15 14:16:44,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {847#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {847#true} is VALID [2022-04-15 14:16:44,198 INFO L272 TraceCheckUtils]: 6: Hoare triple {847#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {847#true} is VALID [2022-04-15 14:16:44,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {847#true} ~cond := #in~cond; {847#true} is VALID [2022-04-15 14:16:44,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {847#true} assume !(0 == ~cond); {847#true} is VALID [2022-04-15 14:16:44,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {847#true} assume true; {847#true} is VALID [2022-04-15 14:16:44,199 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {847#true} {847#true} #78#return; {847#true} is VALID [2022-04-15 14:16:44,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {847#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 14:16:44,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 14:16:44,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 14:16:44,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 14:16:44,202 INFO L272 TraceCheckUtils]: 15: Hoare triple {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {847#true} is VALID [2022-04-15 14:16:44,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {847#true} ~cond := #in~cond; {847#true} is VALID [2022-04-15 14:16:44,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {847#true} assume !(0 == ~cond); {847#true} is VALID [2022-04-15 14:16:44,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {847#true} assume true; {847#true} is VALID [2022-04-15 14:16:44,203 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {847#true} {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #80#return; {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-15 14:16:44,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {885#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {848#false} is VALID [2022-04-15 14:16:44,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {848#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {848#false} is VALID [2022-04-15 14:16:44,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {848#false} assume !false; {848#false} is VALID [2022-04-15 14:16:44,205 INFO L272 TraceCheckUtils]: 23: Hoare triple {848#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {848#false} is VALID [2022-04-15 14:16:44,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {848#false} ~cond := #in~cond; {848#false} is VALID [2022-04-15 14:16:44,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {848#false} assume 0 == ~cond; {848#false} is VALID [2022-04-15 14:16:44,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {848#false} assume !false; {848#false} is VALID [2022-04-15 14:16:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 14:16:44,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:16:44,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:16:44,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383729035] [2022-04-15 14:16:44,205 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:16:44,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336778608] [2022-04-15 14:16:44,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336778608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:16:44,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:16:44,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:16:44,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:16:44,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1285855290] [2022-04-15 14:16:44,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1285855290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:16:44,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:16:44,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:16:44,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495492260] [2022-04-15 14:16:44,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:16:44,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-15 14:16:44,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:16:44,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:16:44,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:44,226 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:16:44,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:44,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:16:44,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:16:44,228 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:16:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:44,327 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-15 14:16:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:16:44,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-15 14:16:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:16:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:16:44,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-15 14:16:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:16:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-15 14:16:44,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-15 14:16:44,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:44,368 INFO L225 Difference]: With dead ends: 57 [2022-04-15 14:16:44,368 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 14:16:44,368 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:16:44,369 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:16:44,369 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:16:44,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 14:16:44,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 14:16:44,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:16:44,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:16:44,390 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:16:44,390 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:16:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:44,392 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 14:16:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 14:16:44,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:44,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:44,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-15 14:16:44,396 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-15 14:16:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:44,398 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 14:16:44,398 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 14:16:44,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:44,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:44,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:16:44,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:16:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:16:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-15 14:16:44,402 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2022-04-15 14:16:44,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:16:44,403 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-15 14:16:44,403 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:16:44,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2022-04-15 14:16:44,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 14:16:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 14:16:44,464 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:16:44,464 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:16:44,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 14:16:44,664 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:16:44,665 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:16:44,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:16:44,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1574040585, now seen corresponding path program 1 times [2022-04-15 14:16:44,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:44,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [91432550] [2022-04-15 14:16:44,718 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 14:16:44,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1205839047, now seen corresponding path program 1 times [2022-04-15 14:16:44,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:16:44,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321664191] [2022-04-15 14:16:44,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:16:44,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:16:44,745 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:16:44,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1146541316] [2022-04-15 14:16:44,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:16:44,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:16:44,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:16:44,748 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:16:44,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 14:16:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:16:44,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 14:16:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:16:44,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:16:45,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {1184#true} call ULTIMATE.init(); {1184#true} is VALID [2022-04-15 14:16:45,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1184#true} is VALID [2022-04-15 14:16:45,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {1184#true} assume true; {1184#true} is VALID [2022-04-15 14:16:45,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1184#true} {1184#true} #84#return; {1184#true} is VALID [2022-04-15 14:16:45,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {1184#true} call #t~ret2 := main(); {1184#true} is VALID [2022-04-15 14:16:45,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {1184#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1184#true} is VALID [2022-04-15 14:16:45,333 INFO L272 TraceCheckUtils]: 6: Hoare triple {1184#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 10 then 1 else 0)); {1184#true} is VALID [2022-04-15 14:16:45,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {1184#true} ~cond := #in~cond; {1210#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:16:45,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {1210#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1214#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:16:45,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {1214#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1214#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:16:45,337 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1214#(not (= |assume_abort_if_not_#in~cond| 0))} {1184#true} #78#return; {1221#(<= (mod main_~A~0 4294967296) 10)} is VALID [2022-04-15 14:16:45,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {1221#(<= (mod main_~A~0 4294967296) 10)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-15 14:16:45,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} [90] L34-2-->L35_primed: Formula: (or (and (= (mod v_main_~b~0_Out_4 2) 0) (= v_main_~r~0_In_2 0) (<= (mod (div (- v_main_~b~0_Out_4) (- 2)) 4294967296) (mod v_main_~r~0_In_2 4294967296))) (= v_main_~r~0_In_2 v_main_~r~0_In_2)) InVars {main_~r~0=v_main_~r~0_In_2} OutVars{main_~b~0=v_main_~b~0_Out_4, main_~r~0=v_main_~r~0_In_2} AuxVars[] AssignedVars[main_~b~0] {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-15 14:16:45,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} [89] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-15 14:16:45,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-15 14:16:45,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume !false; {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-15 14:16:45,339 INFO L272 TraceCheckUtils]: 16: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1184#true} is VALID [2022-04-15 14:16:45,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {1184#true} ~cond := #in~cond; {1184#true} is VALID [2022-04-15 14:16:45,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {1184#true} assume !(0 == ~cond); {1184#true} is VALID [2022-04-15 14:16:45,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {1184#true} assume true; {1184#true} is VALID [2022-04-15 14:16:45,340 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1184#true} {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} #80#return; {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-15 14:16:45,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} 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); {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-15 14:16:45,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {1225#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 10))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1259#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= (+ (- 1) main_~q~0) 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-15 14:16:45,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {1259#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= (+ (- 1) main_~q~0) 0) (<= (mod main_~A~0 4294967296) 10))} assume !false; {1259#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= (+ (- 1) main_~q~0) 0) (<= (mod main_~A~0 4294967296) 10))} is VALID [2022-04-15 14:16:45,344 INFO L272 TraceCheckUtils]: 24: Hoare triple {1259#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= (+ (- 1) main_~q~0) 0) (<= (mod main_~A~0 4294967296) 10))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1266#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:16:45,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {1266#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1270#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:16:45,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {1270#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1185#false} is VALID [2022-04-15 14:16:45,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {1185#false} assume !false; {1185#false} is VALID [2022-04-15 14:16:45,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 14:16:45,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:16:49,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:16:49,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321664191] [2022-04-15 14:16:49,980 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:16:49,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146541316] [2022-04-15 14:16:49,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146541316] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 14:16:49,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 14:16:49,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 14:16:50,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:16:50,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [91432550] [2022-04-15 14:16:50,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [91432550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:16:50,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:16:50,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 14:16:50,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127932382] [2022-04-15 14:16:50,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:16:50,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-15 14:16:50,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:16:50,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:16:50,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:50,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 14:16:50,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:50,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 14:16:50,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=120, Unknown=2, NotChecked=0, Total=156 [2022-04-15 14:16:50,056 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:16:52,375 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:16:54,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:16:56,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:16:57,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:57,071 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-15 14:16:57,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 14:16:57,072 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-15 14:16:57,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:16:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:16:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-04-15 14:16:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:16:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-04-15 14:16:57,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 51 transitions. [2022-04-15 14:16:57,135 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-15 14:16:57,136 INFO L225 Difference]: With dead ends: 48 [2022-04-15 14:16:57,137 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 14:16:57,137 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=42, Invalid=166, Unknown=2, NotChecked=0, Total=210 [2022-04-15 14:16:57,137 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 14:16:57,138 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 108 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 14:16:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 14:16:57,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-04-15 14:16:57,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:16:57,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 42 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:16:57,162 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 42 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:16:57,163 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 42 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:16:57,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:57,164 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-15 14:16:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-15 14:16:57,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:57,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:57,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-15 14:16:57,165 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-15 14:16:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:16:57,166 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-15 14:16:57,166 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-15 14:16:57,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:16:57,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:16:57,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:16:57,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:16:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:16:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-15 14:16:57,168 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 29 [2022-04-15 14:16:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:16:57,168 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-15 14:16:57,168 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:16:57,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 46 transitions. [2022-04-15 14:16:57,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:16:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-15 14:16:57,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 14:16:57,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:16:57,235 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:16:57,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 14:16:57,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:16:57,439 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:16:57,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:16:57,440 INFO L85 PathProgramCache]: Analyzing trace with hash -758101483, now seen corresponding path program 2 times [2022-04-15 14:16:57,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:16:57,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [618969103] [2022-04-15 14:16:57,484 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 14:16:57,485 INFO L85 PathProgramCache]: Analyzing trace with hash 56536339, now seen corresponding path program 1 times [2022-04-15 14:16:57,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:16:57,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306702987] [2022-04-15 14:16:57,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:16:57,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:16:57,493 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:16:57,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1555179551] [2022-04-15 14:16:57,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:16:57,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:16:57,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:16:57,495 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:16:57,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process