/usr/bin/java -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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono3_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-14 21:04:48,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-14 21:04:48,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-14 21:04:49,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-14 21:04:49,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-14 21:04:49,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-14 21:04:49,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-14 21:04:49,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-14 21:04:49,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-14 21:04:49,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-14 21:04:49,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-14 21:04:49,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-14 21:04:49,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-14 21:04:49,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-14 21:04:49,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-14 21:04:49,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-14 21:04:49,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-14 21:04:49,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-14 21:04:49,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-14 21:04:49,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-14 21:04:49,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-14 21:04:49,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-14 21:04:49,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-14 21:04:49,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-14 21:04:49,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-14 21:04:49,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-14 21:04:49,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-14 21:04:49,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-14 21:04:49,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-14 21:04:49,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-14 21:04:49,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-14 21:04:49,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-14 21:04:49,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-14 21:04:49,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-14 21:04:49,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-14 21:04:49,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-14 21:04:49,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-14 21:04:49,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-14 21:04:49,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-14 21:04:49,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-14 21:04:49,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-14 21:04:49,051 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-14 21:04:49,056 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-14 21:04:49,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-14 21:04:49,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-14 21:04:49,057 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-14 21:04:49,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-14 21:04:49,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-14 21:04:49,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-14 21:04:49,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-14 21:04:49,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-14 21:04:49,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-14 21:04:49,058 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-14 21:04:49,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-14 21:04:49,058 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-14 21:04:49,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-14 21:04:49,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-14 21:04:49,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-14 21:04:49,058 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-14 21:04:49,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-14 21:04:49,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:04:49,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-14 21:04:49,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-14 21:04:49,059 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-14 21:04:49,059 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-02-14 21:04:49,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-14 21:04:49,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-14 21:04:49,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-14 21:04:49,249 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-14 21:04:49,250 INFO L275 PluginConnector]: CDTParser initialized [2022-02-14 21:04:49,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2022-02-14 21:04:49,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08658d52c/ce91eb0e302e43f6863a4dade1fa678b/FLAG4ebedf86c [2022-02-14 21:04:49,634 INFO L306 CDTParser]: Found 1 translation units. [2022-02-14 21:04:49,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2022-02-14 21:04:49,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08658d52c/ce91eb0e302e43f6863a4dade1fa678b/FLAG4ebedf86c [2022-02-14 21:04:49,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08658d52c/ce91eb0e302e43f6863a4dade1fa678b [2022-02-14 21:04:49,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-14 21:04:49,650 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-14 21:04:49,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-14 21:04:49,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-14 21:04:49,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-14 21:04:49,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:04:49" (1/1) ... [2022-02-14 21:04:49,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1a1335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:49, skipping insertion in model container [2022-02-14 21:04:49,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:04:49" (1/1) ... [2022-02-14 21:04:49,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-14 21:04:49,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-14 21:04:49,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c[311,324] [2022-02-14 21:04:49,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:04:49,788 INFO L203 MainTranslator]: Completed pre-run [2022-02-14 21:04:49,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c[311,324] [2022-02-14 21:04:49,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:04:49,825 INFO L208 MainTranslator]: Completed translation [2022-02-14 21:04:49,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:49 WrapperNode [2022-02-14 21:04:49,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-14 21:04:49,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-14 21:04:49,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-14 21:04:49,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-14 21:04:49,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:49" (1/1) ... [2022-02-14 21:04:49,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:49" (1/1) ... [2022-02-14 21:04:49,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:49" (1/1) ... [2022-02-14 21:04:49,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:49" (1/1) ... [2022-02-14 21:04:49,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:49" (1/1) ... [2022-02-14 21:04:49,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:49" (1/1) ... [2022-02-14 21:04:49,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:49" (1/1) ... [2022-02-14 21:04:49,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-14 21:04:49,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-14 21:04:49,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-14 21:04:49,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-14 21:04:49,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:49" (1/1) ... [2022-02-14 21:04:49,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:04:49,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:04:49,885 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-02-14 21:04:49,902 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-02-14 21:04:49,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-14 21:04:49,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-14 21:04:49,916 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-14 21:04:49,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-14 21:04:49,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-14 21:04:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-14 21:04:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-14 21:04:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-14 21:04:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-14 21:04:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-14 21:04:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-14 21:04:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-14 21:04:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-14 21:04:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-14 21:04:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-14 21:04:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-14 21:04:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-14 21:04:49,961 INFO L234 CfgBuilder]: Building ICFG [2022-02-14 21:04:49,963 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-14 21:04:50,050 INFO L275 CfgBuilder]: Performing block encoding [2022-02-14 21:04:50,054 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-14 21:04:50,054 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-14 21:04:50,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:04:50 BoogieIcfgContainer [2022-02-14 21:04:50,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-14 21:04:50,056 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-14 21:04:50,056 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-14 21:04:50,057 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-14 21:04:50,059 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:04:50" (1/1) ... [2022-02-14 21:04:50,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:04:50 BasicIcfg [2022-02-14 21:04:50,070 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-14 21:04:50,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-14 21:04:50,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-14 21:04:50,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-14 21:04:50,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 09:04:49" (1/4) ... [2022-02-14 21:04:50,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271ce15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:04:50, skipping insertion in model container [2022-02-14 21:04:50,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:04:49" (2/4) ... [2022-02-14 21:04:50,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271ce15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:04:50, skipping insertion in model container [2022-02-14 21:04:50,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:04:50" (3/4) ... [2022-02-14 21:04:50,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271ce15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 09:04:50, skipping insertion in model container [2022-02-14 21:04:50,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:04:50" (4/4) ... [2022-02-14 21:04:50,075 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono3_1.cJordan [2022-02-14 21:04:50,079 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-14 21:04:50,079 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-14 21:04:50,108 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-14 21:04:50,113 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-14 21:04:50,113 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-14 21:04:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 21:04:50,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-14 21:04:50,128 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:04:50,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:04:50,140 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:04:50,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:04:50,144 INFO L85 PathProgramCache]: Analyzing trace with hash -154368955, now seen corresponding path program 1 times [2022-02-14 21:04:50,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:04:50,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688490336] [2022-02-14 21:04:50,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:50,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:04:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:50,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:04:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:50,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:04:50,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688490336] [2022-02-14 21:04:50,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688490336] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:04:50,271 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:04:50,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-14 21:04:50,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762528332] [2022-02-14 21:04:50,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:04:50,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-14 21:04:50,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:04:50,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-14 21:04:50,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-14 21:04:50,294 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:50,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:04:50,329 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-14 21:04:50,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-14 21:04:50,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-14 21:04:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:04:50,336 INFO L225 Difference]: With dead ends: 20 [2022-02-14 21:04:50,336 INFO L226 Difference]: Without dead ends: 14 [2022-02-14 21:04:50,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-14 21:04:50,339 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:04:50,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:04:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-14 21:04:50,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-14 21:04:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-02-14 21:04:50,364 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-02-14 21:04:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:04:50,365 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-02-14 21:04:50,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-14 21:04:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-14 21:04:50,366 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:04:50,366 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:04:50,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-14 21:04:50,366 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:04:50,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:04:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash -153445434, now seen corresponding path program 1 times [2022-02-14 21:04:50,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:04:50,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621081956] [2022-02-14 21:04:50,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:50,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:04:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:50,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:04:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:50,478 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:04:50,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621081956] [2022-02-14 21:04:50,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621081956] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:04:50,478 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:04:50,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-14 21:04:50,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134448726] [2022-02-14 21:04:50,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:04:50,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-14 21:04:50,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:04:50,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-14 21:04:50,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-14 21:04:50,481 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:04:50,518 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-02-14 21:04:50,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-14 21:04:50,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-14 21:04:50,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:04:50,519 INFO L225 Difference]: With dead ends: 17 [2022-02-14 21:04:50,519 INFO L226 Difference]: Without dead ends: 17 [2022-02-14 21:04:50,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-14 21:04:50,520 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:04:50,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:04:50,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-14 21:04:50,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-14 21:04:50,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-02-14 21:04:50,523 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-02-14 21:04:50,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:04:50,524 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-02-14 21:04:50,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-14 21:04:50,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-14 21:04:50,524 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:04:50,524 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:04:50,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-14 21:04:50,525 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:04:50,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:04:50,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1203653974, now seen corresponding path program 1 times [2022-02-14 21:04:50,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:04:50,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709772934] [2022-02-14 21:04:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:50,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:04:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:50,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:04:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:50,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:04:50,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709772934] [2022-02-14 21:04:50,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709772934] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:04:50,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882240456] [2022-02-14 21:04:50,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:50,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:04:50,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:04:50,589 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-02-14 21:04:50,605 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-02-14 21:04:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:50,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-14 21:04:50,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:04:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:50,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:04:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:50,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882240456] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:04:50,865 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:04:50,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 8] total 14 [2022-02-14 21:04:50,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697082447] [2022-02-14 21:04:50,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:04:50,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-14 21:04:50,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:04:50,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-14 21:04:50,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-14 21:04:50,866 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:04:51,114 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-14 21:04:51,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-14 21:04:51,114 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-14 21:04:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:04:51,115 INFO L225 Difference]: With dead ends: 29 [2022-02-14 21:04:51,115 INFO L226 Difference]: Without dead ends: 25 [2022-02-14 21:04:51,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2022-02-14 21:04:51,119 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:04:51,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 41 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 21:04:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-14 21:04:51,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-02-14 21:04:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-02-14 21:04:51,127 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-02-14 21:04:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:04:51,128 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-02-14 21:04:51,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-14 21:04:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:04:51,129 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:04:51,129 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:04:51,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-14 21:04:51,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:04:51,346 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:04:51,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:04:51,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2025124503, now seen corresponding path program 1 times [2022-02-14 21:04:51,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:04:51,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918720223] [2022-02-14 21:04:51,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:51,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:04:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:51,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:04:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:04:51,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:04:51,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918720223] [2022-02-14 21:04:51,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918720223] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:04:51,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453103372] [2022-02-14 21:04:51,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:51,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:04:51,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:04:51,426 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-02-14 21:04:51,427 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-02-14 21:04:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:51,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-14 21:04:51,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:04:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:04:51,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:04:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:04:51,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453103372] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:04:51,652 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:04:51,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-02-14 21:04:51,653 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68621003] [2022-02-14 21:04:51,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:04:51,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-14 21:04:51,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:04:51,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-14 21:04:51,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-14 21:04:51,658 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:04:52,004 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-02-14 21:04:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-14 21:04:52,005 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-14 21:04:52,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:04:52,011 INFO L225 Difference]: With dead ends: 49 [2022-02-14 21:04:52,011 INFO L226 Difference]: Without dead ends: 45 [2022-02-14 21:04:52,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2022-02-14 21:04:52,015 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:04:52,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 52 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 21:04:52,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-14 21:04:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-02-14 21:04:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-02-14 21:04:52,026 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 20 [2022-02-14 21:04:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:04:52,026 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-02-14 21:04:52,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-02-14 21:04:52,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-14 21:04:52,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:04:52,027 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:04:52,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-14 21:04:52,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-14 21:04:52,245 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:04:52,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:04:52,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1905741238, now seen corresponding path program 2 times [2022-02-14 21:04:52,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:04:52,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111226865] [2022-02-14 21:04:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:52,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:04:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:52,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:04:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:04:52,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:04:52,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111226865] [2022-02-14 21:04:52,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111226865] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:04:52,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424107097] [2022-02-14 21:04:52,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:04:52,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:04:52,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:04:52,335 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-02-14 21:04:52,336 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-02-14 21:04:52,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:04:52,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:04:52,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-14 21:04:52,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:04:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-14 21:04:52,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:04:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-14 21:04:52,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424107097] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:04:52,550 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:04:52,550 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2022-02-14 21:04:52,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067416377] [2022-02-14 21:04:52,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:04:52,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-14 21:04:52,551 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:04:52,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-14 21:04:52,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-02-14 21:04:52,553 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:04:53,089 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2022-02-14 21:04:53,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-14 21:04:53,090 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-14 21:04:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:04:53,091 INFO L225 Difference]: With dead ends: 85 [2022-02-14 21:04:53,091 INFO L226 Difference]: Without dead ends: 80 [2022-02-14 21:04:53,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2022-02-14 21:04:53,092 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:04:53,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 69 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-14 21:04:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-14 21:04:53,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2022-02-14 21:04:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-02-14 21:04:53,096 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 26 [2022-02-14 21:04:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:04:53,097 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-02-14 21:04:53,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:53,097 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-02-14 21:04:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-14 21:04:53,097 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:04:53,098 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:04:53,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-14 21:04:53,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:04:53,308 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:04:53,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:04:53,308 INFO L85 PathProgramCache]: Analyzing trace with hash 81509943, now seen corresponding path program 3 times [2022-02-14 21:04:53,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:04:53,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362938963] [2022-02-14 21:04:53,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:53,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:04:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:53,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:04:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 37 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-14 21:04:53,460 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:04:53,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362938963] [2022-02-14 21:04:53,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362938963] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:04:53,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494055849] [2022-02-14 21:04:53,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-14 21:04:53,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:04:53,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:04:53,467 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-02-14 21:04:53,480 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-02-14 21:04:53,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-02-14 21:04:53,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:04:53,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-14 21:04:53,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:04:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-14 21:04:53,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:04:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-14 21:04:53,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494055849] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:04:53,793 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:04:53,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-02-14 21:04:53,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779121331] [2022-02-14 21:04:53,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:04:53,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-14 21:04:53,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:04:53,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-14 21:04:53,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-02-14 21:04:53,795 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:04:55,374 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-02-14 21:04:55,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-14 21:04:55,375 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-14 21:04:55,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:04:55,376 INFO L225 Difference]: With dead ends: 109 [2022-02-14 21:04:55,376 INFO L226 Difference]: Without dead ends: 109 [2022-02-14 21:04:55,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=477, Invalid=1083, Unknown=0, NotChecked=0, Total=1560 [2022-02-14 21:04:55,377 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 127 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:04:55,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 58 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-14 21:04:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-14 21:04:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 57. [2022-02-14 21:04:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2022-02-14 21:04:55,382 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 32 [2022-02-14 21:04:55,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:04:55,382 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2022-02-14 21:04:55,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:04:55,382 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-02-14 21:04:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-14 21:04:55,383 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:04:55,383 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:04:55,389 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-02-14 21:04:55,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:04:55,587 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:04:55,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:04:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash -912098025, now seen corresponding path program 4 times [2022-02-14 21:04:55,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:04:55,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595081879] [2022-02-14 21:04:55,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:04:55,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:04:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:55,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:04:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:04:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 173 proven. 57 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-02-14 21:04:55,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:04:55,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595081879] [2022-02-14 21:04:55,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595081879] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:04:55,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498851015] [2022-02-14 21:04:55,730 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-14 21:04:55,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:04:55,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:04:55,733 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-02-14 21:04:55,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-14 21:04:55,793 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-14 21:04:55,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:04:55,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-14 21:04:55,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:04:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 101 proven. 222 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-14 21:04:56,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:04:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 101 proven. 222 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-14 21:04:56,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498851015] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:04:56,605 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:04:56,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 16] total 31 [2022-02-14 21:04:56,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571009806] [2022-02-14 21:04:56,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:04:56,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-14 21:04:56,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:04:56,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-14 21:04:56,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2022-02-14 21:04:56,607 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:05:07,466 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-02-14 21:05:07,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-14 21:05:07,467 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-02-14 21:05:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:05:07,467 INFO L225 Difference]: With dead ends: 117 [2022-02-14 21:05:07,467 INFO L226 Difference]: Without dead ends: 117 [2022-02-14 21:05:07,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=924, Invalid=2382, Unknown=0, NotChecked=0, Total=3306 [2022-02-14 21:05:07,469 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 255 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-14 21:05:07,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 79 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-14 21:05:07,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-14 21:05:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-02-14 21:05:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2022-02-14 21:05:07,474 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 56 [2022-02-14 21:05:07,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:05:07,474 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2022-02-14 21:05:07,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2022-02-14 21:05:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-02-14 21:05:07,476 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:07,476 INFO L514 BasicCegarLoop]: trace histogram [35, 35, 26, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:07,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-14 21:05:07,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:07,677 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:07,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:07,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2051530473, now seen corresponding path program 5 times [2022-02-14 21:05:07,678 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:07,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166999923] [2022-02-14 21:05:07,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:07,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:08,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 693 proven. 1027 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-02-14 21:05:08,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:08,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166999923] [2022-02-14 21:05:08,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166999923] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:05:08,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7524315] [2022-02-14 21:05:08,261 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-14 21:05:08,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:08,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:05:08,263 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:05:08,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-14 21:05:16,269 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2022-02-14 21:05:16,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:05:16,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 80 conjunts are in the unsatisfiable core [2022-02-14 21:05:16,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:05:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1794 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-14 21:05:17,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:05:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1794 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-14 21:05:19,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7524315] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:05:19,504 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:05:19,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 32] total 88 [2022-02-14 21:05:19,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819292048] [2022-02-14 21:05:19,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:05:19,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-02-14 21:05:19,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:19,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-02-14 21:05:19,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=972, Invalid=6684, Unknown=0, NotChecked=0, Total=7656 [2022-02-14 21:05:19,508 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 88 states, 88 states have (on average 3.102272727272727) internal successors, (273), 86 states have internal predecessors, (273), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:24,302 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 16 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (<= (+ (div c_main_~x~0 4294967296) 1) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or .cse0 (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 15 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (or (not (< (mod (+ c_main_~x~0 1) 4294967296) 500000)) .cse0) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= 0 (mod (+ 17 c_main_~y~0) 4294967296))) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (<= c_main_~x~0 26) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-02-14 21:07:34,375 WARN L228 SmtUtils]: Spent 54.17s on a formula simplification that was a NOOP. DAG size: 138 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:07:36,388 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-02-14 21:07:38,606 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 16 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or .cse0 (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 15 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (or (not (< (mod (+ c_main_~x~0 1) 4294967296) 500000)) .cse0) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-02-14 21:07:40,614 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 15 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (or (not (< (mod (+ c_main_~x~0 1) 4294967296) 500000)) (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0))) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0))) is different from false [2022-02-14 21:07:44,695 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)) (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 15 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0))) is different from false [2022-02-14 21:09:38,087 WARN L228 SmtUtils]: Spent 42.13s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:11:54,511 WARN L228 SmtUtils]: Spent 55.75s on a formula simplification that was a NOOP. DAG size: 134 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:12:03,709 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or .cse0 (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (or (not (< (mod (+ c_main_~x~0 1) 4294967296) 500000)) .cse0) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-02-14 21:12:06,049 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (or (not (< (mod (+ c_main_~x~0 1) 4294967296) 500000)) (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0))) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0))) is different from false [2022-02-14 21:14:00,577 WARN L228 SmtUtils]: Spent 39.81s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:15:56,263 WARN L228 SmtUtils]: Spent 46.21s on a formula simplification that was a NOOP. DAG size: 134 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:17:33,985 WARN L228 SmtUtils]: Spent 43.04s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:17:35,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:17:36,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:17:40,951 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-02-14 21:19:06,256 WARN L228 SmtUtils]: Spent 34.77s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:19:20,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []