/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 06:38:25,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 06:38:25,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 06:38:25,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 06:38:25,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 06:38:25,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 06:38:25,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 06:38:25,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 06:38:25,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 06:38:25,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 06:38:25,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 06:38:25,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 06:38:25,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 06:38:25,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 06:38:25,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 06:38:25,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 06:38:25,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 06:38:25,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 06:38:25,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 06:38:25,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 06:38:25,851 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 06:38:25,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 06:38:25,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 06:38:25,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 06:38:25,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 06:38:25,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 06:38:25,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 06:38:25,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 06:38:25,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 06:38:25,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 06:38:25,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 06:38:25,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 06:38:25,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 06:38:25,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 06:38:25,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 06:38:25,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 06:38:25,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 06:38:25,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 06:38:25,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 06:38:25,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 06:38:25,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 06:38:25,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 06:38:25,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 06:38:25,886 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 06:38:25,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 06:38:25,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 06:38:25,887 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 06:38:25,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 06:38:25,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 06:38:25,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 06:38:25,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 06:38:25,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 06:38:25,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 06:38:25,888 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 06:38:25,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 06:38:25,888 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 06:38:25,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 06:38:25,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 06:38:25,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 06:38:25,889 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 06:38:25,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 06:38:25,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:38:25,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 06:38:25,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 06:38:25,889 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 06:38:25,889 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 06:38:25,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 06:38:25,889 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 06:38:25,889 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 06:38:26,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 06:38:26,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 06:38:26,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 06:38:26,091 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 06:38:26,091 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 06:38:26,092 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound50.c [2022-04-08 06:38:26,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e1d856bf/f8d044d0c07046108424bc049bb55c60/FLAGab680e22d [2022-04-08 06:38:26,450 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 06:38:26,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound50.c [2022-04-08 06:38:26,455 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e1d856bf/f8d044d0c07046108424bc049bb55c60/FLAGab680e22d [2022-04-08 06:38:26,903 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e1d856bf/f8d044d0c07046108424bc049bb55c60 [2022-04-08 06:38:26,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 06:38:26,905 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 06:38:26,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 06:38:26,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 06:38:26,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 06:38:26,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:38:26" (1/1) ... [2022-04-08 06:38:26,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff5cd79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:26, skipping insertion in model container [2022-04-08 06:38:26,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:38:26" (1/1) ... [2022-04-08 06:38:26,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 06:38:26,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 06:38:27,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound50.c[537,550] [2022-04-08 06:38:27,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:38:27,188 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 06:38:27,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound50.c[537,550] [2022-04-08 06:38:27,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:38:27,239 INFO L208 MainTranslator]: Completed translation [2022-04-08 06:38:27,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:27 WrapperNode [2022-04-08 06:38:27,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 06:38:27,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 06:38:27,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 06:38:27,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 06:38:27,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:27" (1/1) ... [2022-04-08 06:38:27,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:27" (1/1) ... [2022-04-08 06:38:27,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:27" (1/1) ... [2022-04-08 06:38:27,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:27" (1/1) ... [2022-04-08 06:38:27,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:27" (1/1) ... [2022-04-08 06:38:27,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:27" (1/1) ... [2022-04-08 06:38:27,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:27" (1/1) ... [2022-04-08 06:38:27,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 06:38:27,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 06:38:27,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 06:38:27,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 06:38:27,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:27" (1/1) ... [2022-04-08 06:38:27,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:38:27,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:38:27,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 06:38:27,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 06:38:27,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 06:38:27,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 06:38:27,380 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 06:38:27,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 06:38:27,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 06:38:27,380 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 06:38:27,381 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 06:38:27,381 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 06:38:27,381 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 06:38:27,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 06:38:27,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 06:38:27,382 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 06:38:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 06:38:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 06:38:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 06:38:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 06:38:27,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 06:38:27,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 06:38:27,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 06:38:27,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 06:38:27,434 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 06:38:27,436 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 06:38:27,623 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 06:38:27,642 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 06:38:27,642 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 06:38:27,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:38:27 BoogieIcfgContainer [2022-04-08 06:38:27,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 06:38:27,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 06:38:27,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 06:38:27,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 06:38:27,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 06:38:26" (1/3) ... [2022-04-08 06:38:27,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dca72f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:38:27, skipping insertion in model container [2022-04-08 06:38:27,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:27" (2/3) ... [2022-04-08 06:38:27,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dca72f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:38:27, skipping insertion in model container [2022-04-08 06:38:27,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:38:27" (3/3) ... [2022-04-08 06:38:27,664 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound50.c [2022-04-08 06:38:27,667 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 06:38:27,667 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 06:38:27,718 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 06:38:27,724 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 06:38:27,724 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 06:38:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:38:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 06:38:27,745 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:27,746 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:27,746 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:27,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:27,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1784424332, now seen corresponding path program 1 times [2022-04-08 06:38:27,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:27,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1447637360] [2022-04-08 06:38:27,768 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:27,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1784424332, now seen corresponding path program 2 times [2022-04-08 06:38:27,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:27,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104167553] [2022-04-08 06:38:27,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:27,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:27,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:38:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:27,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-08 06:38:27,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-08 06:38:27,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #101#return; {41#true} is VALID [2022-04-08 06:38:27,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 06:38:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:27,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 06:38:27,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 06:38:27,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 06:38:27,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-08 06:38:27,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 06:38:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:28,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 06:38:28,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 06:38:28,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 06:38:28,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-08 06:38:28,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 06:38:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:28,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 06:38:28,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 06:38:28,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 06:38:28,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #85#return; {42#false} is VALID [2022-04-08 06:38:28,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 06:38:28,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-08 06:38:28,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-08 06:38:28,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #101#return; {41#true} is VALID [2022-04-08 06:38:28,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret6 := main(); {41#true} is VALID [2022-04-08 06:38:28,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {41#true} is VALID [2022-04-08 06:38:28,013 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {41#true} is VALID [2022-04-08 06:38:28,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 06:38:28,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 06:38:28,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 06:38:28,014 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-08 06:38:28,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} ~B~0 := #t~nondet5;havoc #t~nondet5; {42#false} is VALID [2022-04-08 06:38:28,015 INFO L272 TraceCheckUtils]: 12: Hoare triple {42#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {41#true} is VALID [2022-04-08 06:38:28,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 06:38:28,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 06:38:28,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 06:38:28,016 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-08 06:38:28,016 INFO L272 TraceCheckUtils]: 17: Hoare triple {42#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {41#true} is VALID [2022-04-08 06:38:28,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 06:38:28,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 06:38:28,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 06:38:28,017 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {42#false} {42#false} #85#return; {42#false} is VALID [2022-04-08 06:38:28,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {42#false} is VALID [2022-04-08 06:38:28,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-08 06:38:28,018 INFO L272 TraceCheckUtils]: 24: Hoare triple {42#false} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {42#false} is VALID [2022-04-08 06:38:28,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-08 06:38:28,018 INFO L290 TraceCheckUtils]: 26: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-08 06:38:28,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-08 06:38:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 06:38:28,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:28,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104167553] [2022-04-08 06:38:28,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104167553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:28,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:28,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 06:38:28,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:28,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1447637360] [2022-04-08 06:38:28,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1447637360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:28,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:28,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 06:38:28,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128856951] [2022-04-08 06:38:28,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:28,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-08 06:38:28,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:28,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 06:38:28,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:28,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 06:38:28,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:28,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 06:38:28,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 06:38:28,069 INFO L87 Difference]: Start difference. First operand has 38 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 06:38:28,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:28,270 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2022-04-08 06:38:28,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 06:38:28,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-08 06:38:28,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 06:38:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-08 06:38:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 06:38:28,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-08 06:38:28,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-04-08 06:38:28,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:28,424 INFO L225 Difference]: With dead ends: 69 [2022-04-08 06:38:28,424 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 06:38:28,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 06:38:28,432 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:28,434 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:38:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 06:38:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 06:38:28,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:28,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:28,460 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:28,460 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:28,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:28,464 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-08 06:38:28,464 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-08 06:38:28,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:28,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:28,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 33 states. [2022-04-08 06:38:28,466 INFO L87 Difference]: Start difference. First operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 33 states. [2022-04-08 06:38:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:28,469 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-08 06:38:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-08 06:38:28,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:28,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:28,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:28,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-04-08 06:38:28,473 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 28 [2022-04-08 06:38:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:28,474 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-04-08 06:38:28,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 06:38:28,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 43 transitions. [2022-04-08 06:38:28,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-08 06:38:28,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 06:38:28,519 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:28,519 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:28,520 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 06:38:28,520 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:28,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:28,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1361835634, now seen corresponding path program 1 times [2022-04-08 06:38:28,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:28,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [311883169] [2022-04-08 06:38:28,525 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:28,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1361835634, now seen corresponding path program 2 times [2022-04-08 06:38:28,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:28,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259108085] [2022-04-08 06:38:28,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:28,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:28,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:38:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:28,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {331#true} is VALID [2022-04-08 06:38:28,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:28,647 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {331#true} {331#true} #101#return; {331#true} is VALID [2022-04-08 06:38:28,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 06:38:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:28,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {331#true} ~cond := #in~cond; {331#true} is VALID [2022-04-08 06:38:28,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#true} assume !(0 == ~cond); {331#true} is VALID [2022-04-08 06:38:28,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:28,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#true} {331#true} #81#return; {331#true} is VALID [2022-04-08 06:38:28,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 06:38:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:28,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {331#true} ~cond := #in~cond; {331#true} is VALID [2022-04-08 06:38:28,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#true} assume !(0 == ~cond); {331#true} is VALID [2022-04-08 06:38:28,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:28,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#true} {331#true} #83#return; {331#true} is VALID [2022-04-08 06:38:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 06:38:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:28,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {331#true} ~cond := #in~cond; {331#true} is VALID [2022-04-08 06:38:28,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#true} assume !(0 == ~cond); {331#true} is VALID [2022-04-08 06:38:28,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:28,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#true} {331#true} #85#return; {331#true} is VALID [2022-04-08 06:38:28,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {331#true} call ULTIMATE.init(); {351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 06:38:28,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {331#true} is VALID [2022-04-08 06:38:28,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:28,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#true} {331#true} #101#return; {331#true} is VALID [2022-04-08 06:38:28,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {331#true} call #t~ret6 := main(); {331#true} is VALID [2022-04-08 06:38:28,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {331#true} is VALID [2022-04-08 06:38:28,663 INFO L272 TraceCheckUtils]: 6: Hoare triple {331#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {331#true} is VALID [2022-04-08 06:38:28,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#true} ~cond := #in~cond; {331#true} is VALID [2022-04-08 06:38:28,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#true} assume !(0 == ~cond); {331#true} is VALID [2022-04-08 06:38:28,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:28,663 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {331#true} {331#true} #81#return; {331#true} is VALID [2022-04-08 06:38:28,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {331#true} is VALID [2022-04-08 06:38:28,663 INFO L272 TraceCheckUtils]: 12: Hoare triple {331#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {331#true} is VALID [2022-04-08 06:38:28,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {331#true} ~cond := #in~cond; {331#true} is VALID [2022-04-08 06:38:28,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {331#true} assume !(0 == ~cond); {331#true} is VALID [2022-04-08 06:38:28,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:28,664 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {331#true} {331#true} #83#return; {331#true} is VALID [2022-04-08 06:38:28,664 INFO L272 TraceCheckUtils]: 17: Hoare triple {331#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {331#true} is VALID [2022-04-08 06:38:28,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {331#true} ~cond := #in~cond; {331#true} is VALID [2022-04-08 06:38:28,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {331#true} assume !(0 == ~cond); {331#true} is VALID [2022-04-08 06:38:28,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:28,664 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {331#true} {331#true} #85#return; {331#true} is VALID [2022-04-08 06:38:28,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {331#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {348#(= main_~q~0 0)} is VALID [2022-04-08 06:38:28,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {348#(= main_~q~0 0)} assume !false; {348#(= main_~q~0 0)} is VALID [2022-04-08 06:38:28,667 INFO L272 TraceCheckUtils]: 24: Hoare triple {348#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {349#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:38:28,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {349#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {350#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:38:28,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {350#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {332#false} is VALID [2022-04-08 06:38:28,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {332#false} assume !false; {332#false} is VALID [2022-04-08 06:38:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 06:38:28,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:28,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259108085] [2022-04-08 06:38:28,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259108085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:28,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:28,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:28,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:28,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [311883169] [2022-04-08 06:38:28,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [311883169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:28,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:28,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:28,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960452060] [2022-04-08 06:38:28,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:28,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-08 06:38:28,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:28,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:38:28,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:28,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:38:28,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:28,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:38:28,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:38:28,689 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:38:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:29,169 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-08 06:38:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 06:38:29,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-08 06:38:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:38:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 06:38:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:38:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 06:38:29,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-08 06:38:29,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:29,245 INFO L225 Difference]: With dead ends: 46 [2022-04-08 06:38:29,245 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 06:38:29,246 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:38:29,246 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:29,247 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 48 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:38:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 06:38:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-04-08 06:38:29,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:29,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:29,254 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:29,254 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:29,256 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 06:38:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 06:38:29,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:29,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:29,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 44 states. [2022-04-08 06:38:29,258 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 44 states. [2022-04-08 06:38:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:29,260 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 06:38:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 06:38:29,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:29,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:29,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:29,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-04-08 06:38:29,263 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 28 [2022-04-08 06:38:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:29,268 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-04-08 06:38:29,269 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:38:29,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 46 transitions. [2022-04-08 06:38:29,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:29,311 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-08 06:38:29,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 06:38:29,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:29,313 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:29,313 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 06:38:29,313 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:29,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1382067636, now seen corresponding path program 1 times [2022-04-08 06:38:29,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:29,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [581790950] [2022-04-08 06:38:29,317 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:29,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1382067636, now seen corresponding path program 2 times [2022-04-08 06:38:29,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:29,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147021769] [2022-04-08 06:38:29,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:29,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:29,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:38:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:29,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {640#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {616#true} is VALID [2022-04-08 06:38:29,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:29,499 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {616#true} {616#true} #101#return; {616#true} is VALID [2022-04-08 06:38:29,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 06:38:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:29,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:29,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:29,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:29,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {616#true} {616#true} #81#return; {616#true} is VALID [2022-04-08 06:38:29,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 06:38:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:29,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:29,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:29,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:29,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {616#true} {616#true} #83#return; {616#true} is VALID [2022-04-08 06:38:29,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 06:38:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:29,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:29,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:29,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:29,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {616#true} {616#true} #85#return; {616#true} is VALID [2022-04-08 06:38:29,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 06:38:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:29,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:29,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:29,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:29,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {616#true} {633#(= main_~A~0 main_~r~0)} #87#return; {633#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 06:38:29,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {616#true} call ULTIMATE.init(); {640#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 06:38:29,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {640#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {616#true} is VALID [2022-04-08 06:38:29,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:29,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {616#true} {616#true} #101#return; {616#true} is VALID [2022-04-08 06:38:29,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {616#true} call #t~ret6 := main(); {616#true} is VALID [2022-04-08 06:38:29,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {616#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {616#true} is VALID [2022-04-08 06:38:29,546 INFO L272 TraceCheckUtils]: 6: Hoare triple {616#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {616#true} is VALID [2022-04-08 06:38:29,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:29,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:29,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:29,547 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {616#true} {616#true} #81#return; {616#true} is VALID [2022-04-08 06:38:29,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {616#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {616#true} is VALID [2022-04-08 06:38:29,547 INFO L272 TraceCheckUtils]: 12: Hoare triple {616#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {616#true} is VALID [2022-04-08 06:38:29,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:29,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:29,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:29,547 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {616#true} {616#true} #83#return; {616#true} is VALID [2022-04-08 06:38:29,547 INFO L272 TraceCheckUtils]: 17: Hoare triple {616#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {616#true} is VALID [2022-04-08 06:38:29,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:29,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:29,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:29,548 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {616#true} {616#true} #85#return; {616#true} is VALID [2022-04-08 06:38:29,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {616#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {633#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 06:38:29,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {633#(= main_~A~0 main_~r~0)} assume !false; {633#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 06:38:29,550 INFO L272 TraceCheckUtils]: 24: Hoare triple {633#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {616#true} is VALID [2022-04-08 06:38:29,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:29,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:29,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:29,564 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {616#true} {633#(= main_~A~0 main_~r~0)} #87#return; {633#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 06:38:29,565 INFO L272 TraceCheckUtils]: 29: Hoare triple {633#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {638#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:38:29,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {638#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {639#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:38:29,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {639#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {617#false} is VALID [2022-04-08 06:38:29,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {617#false} assume !false; {617#false} is VALID [2022-04-08 06:38:29,566 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 06:38:29,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:29,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147021769] [2022-04-08 06:38:29,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147021769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:29,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:29,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:29,567 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:29,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [581790950] [2022-04-08 06:38:29,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [581790950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:29,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:29,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:29,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505202453] [2022-04-08 06:38:29,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:29,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 06:38:29,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:29,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:38:29,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:29,604 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:38:29,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:29,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:38:29,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:38:29,605 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:38:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:30,020 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-08 06:38:30,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 06:38:30,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 06:38:30,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:38:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 06:38:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:38:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 06:38:30,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-08 06:38:30,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:30,082 INFO L225 Difference]: With dead ends: 50 [2022-04-08 06:38:30,082 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 06:38:30,083 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:38:30,083 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:30,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 48 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:38:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 06:38:30,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-04-08 06:38:30,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:30,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:30,090 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:30,090 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:30,092 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-08 06:38:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-08 06:38:30,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:30,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:30,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 48 states. [2022-04-08 06:38:30,094 INFO L87 Difference]: Start difference. First operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 48 states. [2022-04-08 06:38:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:30,096 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-08 06:38:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-08 06:38:30,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:30,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:30,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:30,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-08 06:38:30,098 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 33 [2022-04-08 06:38:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:30,099 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-08 06:38:30,099 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:38:30,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 49 transitions. [2022-04-08 06:38:30,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:30,144 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-08 06:38:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 06:38:30,145 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:30,145 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:30,145 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 06:38:30,145 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:30,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:30,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1455208590, now seen corresponding path program 1 times [2022-04-08 06:38:30,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:30,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [126496953] [2022-04-08 06:38:30,146 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1455208590, now seen corresponding path program 2 times [2022-04-08 06:38:30,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:30,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103602475] [2022-04-08 06:38:30,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:30,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:30,169 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:38:30,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514371383] [2022-04-08 06:38:30,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:38:30,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:30,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:38:30,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:38:30,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 06:38:30,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:38:30,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:38:30,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 06:38:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:30,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:38:30,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {929#true} call ULTIMATE.init(); {929#true} is VALID [2022-04-08 06:38:30,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {929#true} is VALID [2022-04-08 06:38:30,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-08 06:38:30,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} #101#return; {929#true} is VALID [2022-04-08 06:38:30,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} call #t~ret6 := main(); {929#true} is VALID [2022-04-08 06:38:30,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {929#true} is VALID [2022-04-08 06:38:30,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {929#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {929#true} is VALID [2022-04-08 06:38:30,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-08 06:38:30,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-08 06:38:30,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-08 06:38:30,383 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {929#true} {929#true} #81#return; {929#true} is VALID [2022-04-08 06:38:30,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {929#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {929#true} is VALID [2022-04-08 06:38:30,383 INFO L272 TraceCheckUtils]: 12: Hoare triple {929#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {929#true} is VALID [2022-04-08 06:38:30,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-08 06:38:30,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-08 06:38:30,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-08 06:38:30,384 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {929#true} {929#true} #83#return; {929#true} is VALID [2022-04-08 06:38:30,384 INFO L272 TraceCheckUtils]: 17: Hoare triple {929#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {929#true} is VALID [2022-04-08 06:38:30,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-08 06:38:30,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-08 06:38:30,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-08 06:38:30,384 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {929#true} {929#true} #85#return; {929#true} is VALID [2022-04-08 06:38:30,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {929#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:30,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:30,385 INFO L272 TraceCheckUtils]: 24: Hoare triple {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {929#true} is VALID [2022-04-08 06:38:30,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-08 06:38:30,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-08 06:38:30,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-08 06:38:30,386 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {929#true} {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #87#return; {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:30,386 INFO L272 TraceCheckUtils]: 29: Hoare triple {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {929#true} is VALID [2022-04-08 06:38:30,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-08 06:38:30,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-08 06:38:30,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-08 06:38:30,387 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {929#true} {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #89#return; {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:30,388 INFO L272 TraceCheckUtils]: 34: Hoare triple {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1037#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:38:30,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {1037#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1041#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:38:30,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {1041#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {930#false} is VALID [2022-04-08 06:38:30,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {930#false} assume !false; {930#false} is VALID [2022-04-08 06:38:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 06:38:30,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:38:30,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:30,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103602475] [2022-04-08 06:38:30,389 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:38:30,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514371383] [2022-04-08 06:38:30,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514371383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:30,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:30,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:38:30,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:30,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [126496953] [2022-04-08 06:38:30,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [126496953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:30,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:30,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:38:30,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698236043] [2022-04-08 06:38:30,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:30,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-08 06:38:30,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:30,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 06:38:30,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:30,413 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:38:30,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:30,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:38:30,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:38:30,414 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 06:38:32,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 06:38:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:32,795 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2022-04-08 06:38:32,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:38:32,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-08 06:38:32,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 06:38:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 06:38:32,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 06:38:32,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 06:38:32,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 06:38:32,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:32,862 INFO L225 Difference]: With dead ends: 58 [2022-04-08 06:38:32,862 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 06:38:32,862 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:38:32,863 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:32,863 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 142 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 06:38:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 06:38:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-08 06:38:32,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:32,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 06:38:32,874 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 06:38:32,874 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 06:38:32,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:32,876 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-08 06:38:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-08 06:38:32,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:32,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:32,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 55 states. [2022-04-08 06:38:32,877 INFO L87 Difference]: Start difference. First operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 55 states. [2022-04-08 06:38:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:32,879 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-08 06:38:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-08 06:38:32,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:32,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:32,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:32,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 06:38:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-08 06:38:32,882 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 38 [2022-04-08 06:38:32,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:32,882 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-04-08 06:38:32,883 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 06:38:32,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 69 transitions. [2022-04-08 06:38:32,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-08 06:38:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 06:38:32,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:32,963 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:32,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 06:38:33,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:33,172 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:33,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1688067263, now seen corresponding path program 1 times [2022-04-08 06:38:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:33,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1456560542] [2022-04-08 06:38:33,173 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1688067263, now seen corresponding path program 2 times [2022-04-08 06:38:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:33,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275067927] [2022-04-08 06:38:33,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:33,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:33,189 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:38:33,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1761412510] [2022-04-08 06:38:33,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:38:33,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:33,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:38:33,191 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:38:33,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 06:38:33,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:38:33,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:38:33,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 06:38:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:33,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:38:34,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {1385#true} call ULTIMATE.init(); {1385#true} is VALID [2022-04-08 06:38:34,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {1385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1385#true} is VALID [2022-04-08 06:38:34,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:34,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1385#true} {1385#true} #101#return; {1385#true} is VALID [2022-04-08 06:38:34,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {1385#true} call #t~ret6 := main(); {1385#true} is VALID [2022-04-08 06:38:34,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {1385#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {1385#true} is VALID [2022-04-08 06:38:34,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {1385#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:34,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:34,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:34,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:34,770 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1385#true} {1385#true} #81#return; {1385#true} is VALID [2022-04-08 06:38:34,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {1385#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1385#true} is VALID [2022-04-08 06:38:34,771 INFO L272 TraceCheckUtils]: 12: Hoare triple {1385#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:34,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {1385#true} ~cond := #in~cond; {1429#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:38:34,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {1429#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1433#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:38:34,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {1433#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1433#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:38:34,776 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1433#(not (= |assume_abort_if_not_#in~cond| 0))} {1385#true} #83#return; {1440#(<= (mod main_~B~0 4294967296) 50)} is VALID [2022-04-08 06:38:34,777 INFO L272 TraceCheckUtils]: 17: Hoare triple {1440#(<= (mod main_~B~0 4294967296) 50)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:34,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:34,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:34,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:34,777 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1385#true} {1440#(<= (mod main_~B~0 4294967296) 50)} #85#return; {1440#(<= (mod main_~B~0 4294967296) 50)} is VALID [2022-04-08 06:38:34,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#(<= (mod main_~B~0 4294967296) 50)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1459#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 06:38:34,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {1459#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} assume !false; {1459#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 06:38:34,780 INFO L272 TraceCheckUtils]: 24: Hoare triple {1459#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:34,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:34,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:34,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:34,781 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1385#true} {1459#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} #87#return; {1459#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 06:38:34,782 INFO L272 TraceCheckUtils]: 29: Hoare triple {1459#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:34,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:34,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:34,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:34,783 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1385#true} {1459#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} #89#return; {1459#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 06:38:34,783 INFO L272 TraceCheckUtils]: 34: Hoare triple {1459#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:34,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:34,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:34,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:34,789 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1385#true} {1459#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} #91#return; {1459#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 06:38:34,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {1459#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1511#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50))} is VALID [2022-04-08 06:38:34,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {1511#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50))} assume !false; {1511#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50))} is VALID [2022-04-08 06:38:34,792 INFO L272 TraceCheckUtils]: 41: Hoare triple {1511#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {1518#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:38:34,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {1518#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1522#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:38:34,793 INFO L290 TraceCheckUtils]: 43: Hoare triple {1522#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1386#false} is VALID [2022-04-08 06:38:34,793 INFO L290 TraceCheckUtils]: 44: Hoare triple {1386#false} assume !false; {1386#false} is VALID [2022-04-08 06:38:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 06:38:34,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:38:35,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {1386#false} assume !false; {1386#false} is VALID [2022-04-08 06:38:35,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {1522#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1386#false} is VALID [2022-04-08 06:38:35,279 INFO L290 TraceCheckUtils]: 42: Hoare triple {1518#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1522#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:38:35,280 INFO L272 TraceCheckUtils]: 41: Hoare triple {1538#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {1518#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:38:35,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {1538#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} assume !false; {1538#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} is VALID [2022-04-08 06:38:35,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1538#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} is VALID [2022-04-08 06:38:35,281 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1385#true} {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #91#return; {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:38:35,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:35,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:35,281 INFO L290 TraceCheckUtils]: 35: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:35,281 INFO L272 TraceCheckUtils]: 34: Hoare triple {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:35,283 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1385#true} {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #89#return; {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:38:35,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:35,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:35,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:35,283 INFO L272 TraceCheckUtils]: 29: Hoare triple {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:35,284 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1385#true} {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #87#return; {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:38:35,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:35,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:35,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:35,284 INFO L272 TraceCheckUtils]: 24: Hoare triple {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:35,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:38:35,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {1385#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:38:35,285 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1385#true} {1385#true} #85#return; {1385#true} is VALID [2022-04-08 06:38:35,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:35,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:35,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:35,286 INFO L272 TraceCheckUtils]: 17: Hoare triple {1385#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:35,286 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1385#true} {1385#true} #83#return; {1385#true} is VALID [2022-04-08 06:38:35,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:35,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:35,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:35,286 INFO L272 TraceCheckUtils]: 12: Hoare triple {1385#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:35,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {1385#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1385#true} is VALID [2022-04-08 06:38:35,286 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1385#true} {1385#true} #81#return; {1385#true} is VALID [2022-04-08 06:38:35,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:35,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:35,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:35,287 INFO L272 TraceCheckUtils]: 6: Hoare triple {1385#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:35,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {1385#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {1385#true} is VALID [2022-04-08 06:38:35,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {1385#true} call #t~ret6 := main(); {1385#true} is VALID [2022-04-08 06:38:35,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1385#true} {1385#true} #101#return; {1385#true} is VALID [2022-04-08 06:38:35,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:35,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {1385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1385#true} is VALID [2022-04-08 06:38:35,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {1385#true} call ULTIMATE.init(); {1385#true} is VALID [2022-04-08 06:38:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 06:38:35,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:35,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275067927] [2022-04-08 06:38:35,288 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:38:35,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761412510] [2022-04-08 06:38:35,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761412510] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 06:38:35,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 06:38:35,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-08 06:38:35,289 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:35,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1456560542] [2022-04-08 06:38:35,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1456560542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:35,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:35,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:35,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300956716] [2022-04-08 06:38:35,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:35,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-08 06:38:35,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:35,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 06:38:35,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:35,316 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:38:35,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:35,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:38:35,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-08 06:38:35,317 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 06:38:37,808 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:38:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:38,212 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2022-04-08 06:38:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:38:38,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-08 06:38:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 06:38:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-08 06:38:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 06:38:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-08 06:38:38,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-08 06:38:38,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:38,318 INFO L225 Difference]: With dead ends: 68 [2022-04-08 06:38:38,318 INFO L226 Difference]: Without dead ends: 66 [2022-04-08 06:38:38,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 06:38:38,319 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:38,319 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 151 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 06:38:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-08 06:38:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-08 06:38:38,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:38,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 06:38:38,338 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 06:38:38,338 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 06:38:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:38,341 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-08 06:38:38,341 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-08 06:38:38,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:38,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:38,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-08 06:38:38,342 INFO L87 Difference]: Start difference. First operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-08 06:38:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:38,344 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-08 06:38:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-08 06:38:38,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:38,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:38,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:38,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 06:38:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-04-08 06:38:38,354 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 45 [2022-04-08 06:38:38,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:38,354 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-04-08 06:38:38,355 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 06:38:38,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 81 transitions. [2022-04-08 06:38:38,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-04-08 06:38:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 06:38:38,459 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:38,459 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:38,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 06:38:38,659 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:38,660 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:38,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:38,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1471734606, now seen corresponding path program 1 times [2022-04-08 06:38:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:38,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [115974643] [2022-04-08 06:38:38,661 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1471734606, now seen corresponding path program 2 times [2022-04-08 06:38:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:38,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575203054] [2022-04-08 06:38:38,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:38,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:38,677 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:38:38,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1014879918] [2022-04-08 06:38:38,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:38:38,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:38,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:38:38,698 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:38:38,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 06:38:38,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:38:38,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:38:38,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 06:38:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:38,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:38:41,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {2063#true} call ULTIMATE.init(); {2063#true} is VALID [2022-04-08 06:38:41,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {2063#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2063#true} is VALID [2022-04-08 06:38:41,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:41,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2063#true} {2063#true} #101#return; {2063#true} is VALID [2022-04-08 06:38:41,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {2063#true} call #t~ret6 := main(); {2063#true} is VALID [2022-04-08 06:38:41,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {2063#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {2063#true} is VALID [2022-04-08 06:38:41,177 INFO L272 TraceCheckUtils]: 6: Hoare triple {2063#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:41,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {2063#true} ~cond := #in~cond; {2089#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:38:41,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {2089#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2093#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:38:41,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {2093#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2093#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:38:41,178 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2093#(not (= |assume_abort_if_not_#in~cond| 0))} {2063#true} #81#return; {2100#(<= (mod main_~A~0 4294967296) 50)} is VALID [2022-04-08 06:38:41,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {2100#(<= (mod main_~A~0 4294967296) 50)} ~B~0 := #t~nondet5;havoc #t~nondet5; {2100#(<= (mod main_~A~0 4294967296) 50)} is VALID [2022-04-08 06:38:41,178 INFO L272 TraceCheckUtils]: 12: Hoare triple {2100#(<= (mod main_~A~0 4294967296) 50)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:41,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {2063#true} ~cond := #in~cond; {2089#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:38:41,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {2089#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2093#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:38:41,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {2093#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2093#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:38:41,180 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2093#(not (= |assume_abort_if_not_#in~cond| 0))} {2100#(<= (mod main_~A~0 4294967296) 50)} #83#return; {2119#(and (<= (mod main_~A~0 4294967296) 50) (<= (mod main_~B~0 4294967296) 50))} is VALID [2022-04-08 06:38:41,180 INFO L272 TraceCheckUtils]: 17: Hoare triple {2119#(and (<= (mod main_~A~0 4294967296) 50) (<= (mod main_~B~0 4294967296) 50))} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:41,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {2063#true} ~cond := #in~cond; {2089#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:38:41,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {2089#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2093#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:38:41,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {2093#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2093#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:38:41,181 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2093#(not (= |assume_abort_if_not_#in~cond| 0))} {2119#(and (<= (mod main_~A~0 4294967296) 50) (<= (mod main_~B~0 4294967296) 50))} #85#return; {2135#(and (<= (mod main_~A~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} is VALID [2022-04-08 06:38:41,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {2135#(and (<= (mod main_~A~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2139#(and (<= (mod main_~r~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:41,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {2139#(and (<= (mod main_~r~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {2139#(and (<= (mod main_~r~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:41,182 INFO L272 TraceCheckUtils]: 24: Hoare triple {2139#(and (<= (mod main_~r~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:41,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:41,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:41,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:41,182 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2063#true} {2139#(and (<= (mod main_~r~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #87#return; {2139#(and (<= (mod main_~r~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:41,182 INFO L272 TraceCheckUtils]: 29: Hoare triple {2139#(and (<= (mod main_~r~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:41,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:41,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:41,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:41,183 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2063#true} {2139#(and (<= (mod main_~r~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #89#return; {2139#(and (<= (mod main_~r~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:41,183 INFO L272 TraceCheckUtils]: 34: Hoare triple {2139#(and (<= (mod main_~r~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:41,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:41,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:41,184 INFO L290 TraceCheckUtils]: 37: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:41,184 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2063#true} {2139#(and (<= (mod main_~r~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #91#return; {2139#(and (<= (mod main_~r~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:41,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {2139#(and (<= (mod main_~r~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2191#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} is VALID [2022-04-08 06:38:41,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {2191#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} assume !false; {2191#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} is VALID [2022-04-08 06:38:41,187 INFO L272 TraceCheckUtils]: 41: Hoare triple {2191#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:41,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:41,187 INFO L290 TraceCheckUtils]: 43: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:41,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:41,204 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2063#true} {2191#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} #87#return; {2191#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} is VALID [2022-04-08 06:38:41,204 INFO L272 TraceCheckUtils]: 46: Hoare triple {2191#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:41,204 INFO L290 TraceCheckUtils]: 47: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:41,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:41,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:41,204 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2063#true} {2191#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} #89#return; {2191#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} is VALID [2022-04-08 06:38:41,209 INFO L272 TraceCheckUtils]: 51: Hoare triple {2191#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2228#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:38:41,209 INFO L290 TraceCheckUtils]: 52: Hoare triple {2228#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2232#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:38:41,209 INFO L290 TraceCheckUtils]: 53: Hoare triple {2232#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2064#false} is VALID [2022-04-08 06:38:41,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {2064#false} assume !false; {2064#false} is VALID [2022-04-08 06:38:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-08 06:38:41,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:38:42,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {2064#false} assume !false; {2064#false} is VALID [2022-04-08 06:38:42,944 INFO L290 TraceCheckUtils]: 53: Hoare triple {2232#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2064#false} is VALID [2022-04-08 06:38:42,944 INFO L290 TraceCheckUtils]: 52: Hoare triple {2228#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2232#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:38:42,945 INFO L272 TraceCheckUtils]: 51: Hoare triple {2248#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2228#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:38:42,946 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2063#true} {2248#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #89#return; {2248#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-08 06:38:42,946 INFO L290 TraceCheckUtils]: 49: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:42,946 INFO L290 TraceCheckUtils]: 48: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:42,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:42,946 INFO L272 TraceCheckUtils]: 46: Hoare triple {2248#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:42,946 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2063#true} {2248#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #87#return; {2248#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-08 06:38:42,946 INFO L290 TraceCheckUtils]: 44: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:42,947 INFO L290 TraceCheckUtils]: 43: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:42,947 INFO L290 TraceCheckUtils]: 42: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:42,947 INFO L272 TraceCheckUtils]: 41: Hoare triple {2248#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:42,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {2248#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !false; {2248#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-08 06:38:44,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {2285#(or (= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296)) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2248#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-08 06:38:44,620 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2063#true} {2285#(or (= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296)) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))))} #91#return; {2285#(or (= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296)) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))))} is VALID [2022-04-08 06:38:44,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:44,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:44,621 INFO L290 TraceCheckUtils]: 35: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:44,621 INFO L272 TraceCheckUtils]: 34: Hoare triple {2285#(or (= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296)) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:44,621 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2063#true} {2285#(or (= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296)) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))))} #89#return; {2285#(or (= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296)) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))))} is VALID [2022-04-08 06:38:44,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:44,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:44,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:44,621 INFO L272 TraceCheckUtils]: 29: Hoare triple {2285#(or (= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296)) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:44,622 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2063#true} {2285#(or (= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296)) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))))} #87#return; {2285#(or (= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296)) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))))} is VALID [2022-04-08 06:38:44,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:44,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:44,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:44,622 INFO L272 TraceCheckUtils]: 24: Hoare triple {2285#(or (= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296)) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:44,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {2285#(or (= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296)) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))))} assume !false; {2285#(or (= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296)) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))))} is VALID [2022-04-08 06:38:44,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {2063#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2285#(or (= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296)) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))))} is VALID [2022-04-08 06:38:44,623 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2063#true} {2063#true} #85#return; {2063#true} is VALID [2022-04-08 06:38:44,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:44,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:44,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:44,624 INFO L272 TraceCheckUtils]: 17: Hoare triple {2063#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:44,624 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2063#true} {2063#true} #83#return; {2063#true} is VALID [2022-04-08 06:38:44,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:44,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:44,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:44,624 INFO L272 TraceCheckUtils]: 12: Hoare triple {2063#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:44,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {2063#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {2063#true} is VALID [2022-04-08 06:38:44,624 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2063#true} {2063#true} #81#return; {2063#true} is VALID [2022-04-08 06:38:44,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:44,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:44,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:44,624 INFO L272 TraceCheckUtils]: 6: Hoare triple {2063#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:44,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {2063#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {2063#true} is VALID [2022-04-08 06:38:44,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {2063#true} call #t~ret6 := main(); {2063#true} is VALID [2022-04-08 06:38:44,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2063#true} {2063#true} #101#return; {2063#true} is VALID [2022-04-08 06:38:44,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:44,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {2063#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2063#true} is VALID [2022-04-08 06:38:44,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {2063#true} call ULTIMATE.init(); {2063#true} is VALID [2022-04-08 06:38:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-08 06:38:44,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:44,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575203054] [2022-04-08 06:38:44,625 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:38:44,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014879918] [2022-04-08 06:38:44,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014879918] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 06:38:44,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 06:38:44,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2022-04-08 06:38:44,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:44,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [115974643] [2022-04-08 06:38:44,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [115974643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:44,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:44,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:44,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749039240] [2022-04-08 06:38:44,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:44,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2022-04-08 06:38:44,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:44,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:38:46,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:46,676 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:38:46,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:46,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:38:46,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-08 06:38:46,677 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:38:55,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:38:57,557 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:38:59,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:39:01,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:39:04,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:39:07,040 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:39:09,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:39:11,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:39:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:39:12,083 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2022-04-08 06:39:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 06:39:12,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2022-04-08 06:39:12,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:39:12,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:39:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-08 06:39:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:39:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-08 06:39:12,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-04-08 06:39:14,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:39:14,206 INFO L225 Difference]: With dead ends: 82 [2022-04-08 06:39:14,206 INFO L226 Difference]: Without dead ends: 80 [2022-04-08 06:39:14,207 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:39:14,209 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-04-08 06:39:14,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 163 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 8 Unknown, 0 Unchecked, 17.7s Time] [2022-04-08 06:39:14,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-08 06:39:14,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2022-04-08 06:39:14,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:39:14,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:39:14,238 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:39:14,239 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:39:14,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:39:14,242 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2022-04-08 06:39:14,242 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2022-04-08 06:39:14,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:39:14,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:39:14,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 80 states. [2022-04-08 06:39:14,243 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 80 states. [2022-04-08 06:39:14,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:39:14,245 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2022-04-08 06:39:14,245 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2022-04-08 06:39:14,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:39:14,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:39:14,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:39:14,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:39:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:39:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2022-04-08 06:39:14,248 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 55 [2022-04-08 06:39:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:39:14,249 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2022-04-08 06:39:14,249 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:39:14,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 89 transitions. [2022-04-08 06:39:16,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 88 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:39:16,555 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2022-04-08 06:39:16,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-08 06:39:16,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:39:16,556 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:39:16,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 06:39:16,756 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:39:16,757 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:39:16,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:39:16,757 INFO L85 PathProgramCache]: Analyzing trace with hash -682689219, now seen corresponding path program 1 times [2022-04-08 06:39:16,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:39:16,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [564122422] [2022-04-08 06:39:16,758 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:39:16,758 INFO L85 PathProgramCache]: Analyzing trace with hash -682689219, now seen corresponding path program 2 times [2022-04-08 06:39:16,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:39:16,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384193732] [2022-04-08 06:39:16,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:39:16,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:39:16,769 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:39:16,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1566997349] [2022-04-08 06:39:16,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:39:16,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:39:16,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:39:16,780 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:39:16,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 06:39:16,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:39:16,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:39:16,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 06:39:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:39:16,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:39:19,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {2873#true} call ULTIMATE.init(); {2873#true} is VALID [2022-04-08 06:39:19,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {2873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2873#true} is VALID [2022-04-08 06:39:19,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:19,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2873#true} {2873#true} #101#return; {2873#true} is VALID [2022-04-08 06:39:19,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {2873#true} call #t~ret6 := main(); {2873#true} is VALID [2022-04-08 06:39:19,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {2873#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {2873#true} is VALID [2022-04-08 06:39:19,123 INFO L272 TraceCheckUtils]: 6: Hoare triple {2873#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:19,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {2873#true} ~cond := #in~cond; {2873#true} is VALID [2022-04-08 06:39:19,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {2873#true} assume !(0 == ~cond); {2873#true} is VALID [2022-04-08 06:39:19,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:19,124 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2873#true} {2873#true} #81#return; {2873#true} is VALID [2022-04-08 06:39:19,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {2873#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {2873#true} is VALID [2022-04-08 06:39:19,124 INFO L272 TraceCheckUtils]: 12: Hoare triple {2873#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:19,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {2873#true} ~cond := #in~cond; {2917#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:39:19,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {2917#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2921#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:39:19,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {2921#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2921#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:39:19,125 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2921#(not (= |assume_abort_if_not_#in~cond| 0))} {2873#true} #83#return; {2928#(<= (mod main_~B~0 4294967296) 50)} is VALID [2022-04-08 06:39:19,126 INFO L272 TraceCheckUtils]: 17: Hoare triple {2928#(<= (mod main_~B~0 4294967296) 50)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:19,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {2873#true} ~cond := #in~cond; {2873#true} is VALID [2022-04-08 06:39:19,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {2873#true} assume !(0 == ~cond); {2873#true} is VALID [2022-04-08 06:39:19,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:19,126 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2873#true} {2928#(<= (mod main_~B~0 4294967296) 50)} #85#return; {2928#(<= (mod main_~B~0 4294967296) 50)} is VALID [2022-04-08 06:39:19,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {2928#(<= (mod main_~B~0 4294967296) 50)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2947#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:39:19,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {2947#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {2947#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:39:19,127 INFO L272 TraceCheckUtils]: 24: Hoare triple {2947#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:19,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {2873#true} ~cond := #in~cond; {2873#true} is VALID [2022-04-08 06:39:19,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {2873#true} assume !(0 == ~cond); {2873#true} is VALID [2022-04-08 06:39:19,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:19,128 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2873#true} {2947#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #87#return; {2947#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:39:19,128 INFO L272 TraceCheckUtils]: 29: Hoare triple {2947#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:19,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {2873#true} ~cond := #in~cond; {2873#true} is VALID [2022-04-08 06:39:19,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {2873#true} assume !(0 == ~cond); {2873#true} is VALID [2022-04-08 06:39:19,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:19,128 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2873#true} {2947#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #89#return; {2947#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:39:19,129 INFO L272 TraceCheckUtils]: 34: Hoare triple {2947#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:19,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {2873#true} ~cond := #in~cond; {2873#true} is VALID [2022-04-08 06:39:19,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {2873#true} assume !(0 == ~cond); {2873#true} is VALID [2022-04-08 06:39:19,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:19,129 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2873#true} {2947#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #91#return; {2947#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 06:39:19,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {2947#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {2999#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-08 06:39:19,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {2999#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !false; {2999#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-08 06:39:19,130 INFO L272 TraceCheckUtils]: 41: Hoare triple {2999#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:19,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {2873#true} ~cond := #in~cond; {2873#true} is VALID [2022-04-08 06:39:19,130 INFO L290 TraceCheckUtils]: 43: Hoare triple {2873#true} assume !(0 == ~cond); {2873#true} is VALID [2022-04-08 06:39:19,131 INFO L290 TraceCheckUtils]: 44: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:19,131 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2873#true} {2999#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #93#return; {2999#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-08 06:39:19,131 INFO L272 TraceCheckUtils]: 46: Hoare triple {2999#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:19,131 INFO L290 TraceCheckUtils]: 47: Hoare triple {2873#true} ~cond := #in~cond; {2873#true} is VALID [2022-04-08 06:39:19,131 INFO L290 TraceCheckUtils]: 48: Hoare triple {2873#true} assume !(0 == ~cond); {2873#true} is VALID [2022-04-08 06:39:19,131 INFO L290 TraceCheckUtils]: 49: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:19,132 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2873#true} {2999#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #95#return; {2999#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-08 06:39:19,132 INFO L290 TraceCheckUtils]: 51: Hoare triple {2999#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !(1 != ~p~0 % 4294967296); {2999#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-08 06:39:19,133 INFO L272 TraceCheckUtils]: 52: Hoare triple {2999#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {3039#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:39:19,133 INFO L290 TraceCheckUtils]: 53: Hoare triple {3039#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3043#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:39:19,134 INFO L290 TraceCheckUtils]: 54: Hoare triple {3043#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2874#false} is VALID [2022-04-08 06:39:19,134 INFO L290 TraceCheckUtils]: 55: Hoare triple {2874#false} assume !false; {2874#false} is VALID [2022-04-08 06:39:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-08 06:39:19,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:39:20,463 INFO L290 TraceCheckUtils]: 55: Hoare triple {2874#false} assume !false; {2874#false} is VALID [2022-04-08 06:39:20,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {3043#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2874#false} is VALID [2022-04-08 06:39:20,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {3039#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3043#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:39:20,465 INFO L272 TraceCheckUtils]: 52: Hoare triple {3059#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {3039#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:39:20,465 INFO L290 TraceCheckUtils]: 51: Hoare triple {3059#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} assume !(1 != ~p~0 % 4294967296); {3059#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-08 06:39:20,466 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2873#true} {3059#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} #95#return; {3059#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-08 06:39:20,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:20,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {2873#true} assume !(0 == ~cond); {2873#true} is VALID [2022-04-08 06:39:20,466 INFO L290 TraceCheckUtils]: 47: Hoare triple {2873#true} ~cond := #in~cond; {2873#true} is VALID [2022-04-08 06:39:20,466 INFO L272 TraceCheckUtils]: 46: Hoare triple {3059#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:20,467 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2873#true} {3059#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} #93#return; {3059#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-08 06:39:20,467 INFO L290 TraceCheckUtils]: 44: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:20,467 INFO L290 TraceCheckUtils]: 43: Hoare triple {2873#true} assume !(0 == ~cond); {2873#true} is VALID [2022-04-08 06:39:20,467 INFO L290 TraceCheckUtils]: 42: Hoare triple {2873#true} ~cond := #in~cond; {2873#true} is VALID [2022-04-08 06:39:20,467 INFO L272 TraceCheckUtils]: 41: Hoare triple {3059#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:20,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {3059#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} assume !false; {3059#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-08 06:39:20,468 INFO L290 TraceCheckUtils]: 39: Hoare triple {3099#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {3059#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-08 06:39:20,468 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2873#true} {3099#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #91#return; {3099#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:39:20,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:20,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {2873#true} assume !(0 == ~cond); {2873#true} is VALID [2022-04-08 06:39:20,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {2873#true} ~cond := #in~cond; {2873#true} is VALID [2022-04-08 06:39:20,469 INFO L272 TraceCheckUtils]: 34: Hoare triple {3099#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:20,469 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2873#true} {3099#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #89#return; {3099#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:39:20,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:20,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {2873#true} assume !(0 == ~cond); {2873#true} is VALID [2022-04-08 06:39:20,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {2873#true} ~cond := #in~cond; {2873#true} is VALID [2022-04-08 06:39:20,470 INFO L272 TraceCheckUtils]: 29: Hoare triple {3099#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:20,470 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2873#true} {3099#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #87#return; {3099#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:39:20,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:20,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {2873#true} assume !(0 == ~cond); {2873#true} is VALID [2022-04-08 06:39:20,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {2873#true} ~cond := #in~cond; {2873#true} is VALID [2022-04-08 06:39:20,470 INFO L272 TraceCheckUtils]: 24: Hoare triple {3099#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:20,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {3099#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {3099#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:39:20,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {2873#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3099#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:39:20,471 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2873#true} {2873#true} #85#return; {2873#true} is VALID [2022-04-08 06:39:20,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:20,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {2873#true} assume !(0 == ~cond); {2873#true} is VALID [2022-04-08 06:39:20,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {2873#true} ~cond := #in~cond; {2873#true} is VALID [2022-04-08 06:39:20,471 INFO L272 TraceCheckUtils]: 17: Hoare triple {2873#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:20,472 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2873#true} {2873#true} #83#return; {2873#true} is VALID [2022-04-08 06:39:20,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:20,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {2873#true} assume !(0 == ~cond); {2873#true} is VALID [2022-04-08 06:39:20,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {2873#true} ~cond := #in~cond; {2873#true} is VALID [2022-04-08 06:39:20,472 INFO L272 TraceCheckUtils]: 12: Hoare triple {2873#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:20,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {2873#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {2873#true} is VALID [2022-04-08 06:39:20,472 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2873#true} {2873#true} #81#return; {2873#true} is VALID [2022-04-08 06:39:20,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:20,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {2873#true} assume !(0 == ~cond); {2873#true} is VALID [2022-04-08 06:39:20,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {2873#true} ~cond := #in~cond; {2873#true} is VALID [2022-04-08 06:39:20,472 INFO L272 TraceCheckUtils]: 6: Hoare triple {2873#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {2873#true} is VALID [2022-04-08 06:39:20,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {2873#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {2873#true} is VALID [2022-04-08 06:39:20,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {2873#true} call #t~ret6 := main(); {2873#true} is VALID [2022-04-08 06:39:20,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2873#true} {2873#true} #101#return; {2873#true} is VALID [2022-04-08 06:39:20,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {2873#true} assume true; {2873#true} is VALID [2022-04-08 06:39:20,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {2873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2873#true} is VALID [2022-04-08 06:39:20,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {2873#true} call ULTIMATE.init(); {2873#true} is VALID [2022-04-08 06:39:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-08 06:39:20,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:39:20,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384193732] [2022-04-08 06:39:20,473 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:39:20,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566997349] [2022-04-08 06:39:20,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566997349] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 06:39:20,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 06:39:20,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-08 06:39:20,474 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:39:20,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [564122422] [2022-04-08 06:39:20,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [564122422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:39:20,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:39:20,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:39:20,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999352176] [2022-04-08 06:39:20,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:39:20,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-08 06:39:20,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:39:20,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:39:20,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:39:20,511 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:39:20,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:39:20,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:39:20,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-08 06:39:20,511 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:39:26,624 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:39:28,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:39:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:39:29,687 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2022-04-08 06:39:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:39:29,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-08 06:39:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:39:29,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:39:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 06:39:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:39:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 06:39:29,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 06:39:29,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:39:29,753 INFO L225 Difference]: With dead ends: 77 [2022-04-08 06:39:29,753 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 06:39:29,753 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-08 06:39:29,754 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-08 06:39:29,754 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-04-08 06:39:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 06:39:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 06:39:29,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:39:29,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:39:29,775 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:39:29,775 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:39:29,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:39:29,778 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-04-08 06:39:29,778 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-08 06:39:29,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:39:29,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:39:29,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 70 states. [2022-04-08 06:39:29,778 INFO L87 Difference]: Start difference. First operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 70 states. [2022-04-08 06:39:29,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:39:29,780 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-04-08 06:39:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-08 06:39:29,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:39:29,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:39:29,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:39:29,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:39:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:39:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-08 06:39:29,783 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 56 [2022-04-08 06:39:29,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:39:29,783 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-08 06:39:29,783 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:39:29,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 87 transitions. [2022-04-08 06:39:32,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 86 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:39:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-08 06:39:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 06:39:32,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:39:32,414 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:39:32,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 06:39:32,614 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:39:32,615 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:39:32,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:39:32,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1586192473, now seen corresponding path program 1 times [2022-04-08 06:39:32,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:39:32,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [408275993] [2022-04-08 06:39:32,616 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:39:32,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1586192473, now seen corresponding path program 2 times [2022-04-08 06:39:32,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:39:32,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674584486] [2022-04-08 06:39:32,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:39:32,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:39:32,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:39:32,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [552958350] [2022-04-08 06:39:32,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:39:32,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:39:32,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:39:32,628 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:39:32,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process