/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/Mono1_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-23 16:20:27,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-23 16:20:27,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-23 16:20:27,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-23 16:20:27,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-23 16:20:27,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-23 16:20:27,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-23 16:20:27,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-23 16:20:27,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-23 16:20:27,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-23 16:20:27,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-23 16:20:27,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-23 16:20:27,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-23 16:20:27,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-23 16:20:27,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-23 16:20:27,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-23 16:20:27,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-23 16:20:27,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-23 16:20:27,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-23 16:20:27,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-23 16:20:27,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-23 16:20:27,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-23 16:20:27,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-23 16:20:27,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-23 16:20:27,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-23 16:20:27,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-23 16:20:27,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-23 16:20:27,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-23 16:20:27,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-23 16:20:27,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-23 16:20:27,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-23 16:20:27,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-23 16:20:27,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-23 16:20:27,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-23 16:20:27,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-23 16:20:27,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-23 16:20:27,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-23 16:20:27,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-23 16:20:27,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-23 16:20:27,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-23 16:20:27,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-23 16:20:27,596 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-23 16:20:27,604 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-23 16:20:27,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-23 16:20:27,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-23 16:20:27,605 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-23 16:20:27,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-23 16:20:27,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-23 16:20:27,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-23 16:20:27,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-23 16:20:27,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-23 16:20:27,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-23 16:20:27,606 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-23 16:20:27,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-23 16:20:27,606 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-23 16:20:27,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-23 16:20:27,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-23 16:20:27,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-23 16:20:27,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-23 16:20:27,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-23 16:20:27,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-23 16:20:27,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-23 16:20:27,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-23 16:20:27,608 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-23 16:20:27,608 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-23 16:20:27,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-23 16:20:27,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-23 16:20:27,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-23 16:20:27,775 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-23 16:20:27,776 INFO L275 PluginConnector]: CDTParser initialized [2022-02-23 16:20:27,777 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-02-23 16:20:27,818 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a82216bc/b9568b24d5724c2896a5f86be6407555/FLAG01fda64c9 [2022-02-23 16:20:28,116 INFO L306 CDTParser]: Found 1 translation units. [2022-02-23 16:20:28,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-02-23 16:20:28,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a82216bc/b9568b24d5724c2896a5f86be6407555/FLAG01fda64c9 [2022-02-23 16:20:28,555 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a82216bc/b9568b24d5724c2896a5f86be6407555 [2022-02-23 16:20:28,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-23 16:20:28,558 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-23 16:20:28,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-23 16:20:28,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-23 16:20:28,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-23 16:20:28,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 04:20:28" (1/1) ... [2022-02-23 16:20:28,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113a7d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:20:28, skipping insertion in model container [2022-02-23 16:20:28,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 04:20:28" (1/1) ... [2022-02-23 16:20:28,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-23 16:20:28,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-23 16:20:28,687 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/Mono1_1-2.c[313,326] [2022-02-23 16:20:28,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-23 16:20:28,702 INFO L203 MainTranslator]: Completed pre-run [2022-02-23 16:20:28,714 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/Mono1_1-2.c[313,326] [2022-02-23 16:20:28,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-23 16:20:28,755 INFO L208 MainTranslator]: Completed translation [2022-02-23 16:20:28,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:20:28 WrapperNode [2022-02-23 16:20:28,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-23 16:20:28,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-23 16:20:28,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-23 16:20:28,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-23 16:20:28,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:20:28" (1/1) ... [2022-02-23 16:20:28,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:20:28" (1/1) ... [2022-02-23 16:20:28,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:20:28" (1/1) ... [2022-02-23 16:20:28,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:20:28" (1/1) ... [2022-02-23 16:20:28,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:20:28" (1/1) ... [2022-02-23 16:20:28,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:20:28" (1/1) ... [2022-02-23 16:20:28,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:20:28" (1/1) ... [2022-02-23 16:20:28,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-23 16:20:28,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-23 16:20:28,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-23 16:20:28,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-23 16:20:28,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:20:28" (1/1) ... [2022-02-23 16:20:28,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-23 16:20:28,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:20:28,793 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-23 16:20:28,798 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-23 16:20:28,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-23 16:20:28,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-23 16:20:28,817 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-23 16:20:28,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-23 16:20:28,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-23 16:20:28,818 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-23 16:20:28,818 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-23 16:20:28,818 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-23 16:20:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-23 16:20:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-23 16:20:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-23 16:20:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-23 16:20:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-23 16:20:28,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-23 16:20:28,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-23 16:20:28,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-23 16:20:28,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-23 16:20:28,863 INFO L234 CfgBuilder]: Building ICFG [2022-02-23 16:20:28,864 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-23 16:20:28,942 INFO L275 CfgBuilder]: Performing block encoding [2022-02-23 16:20:28,945 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-23 16:20:28,945 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-23 16:20:28,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 04:20:28 BoogieIcfgContainer [2022-02-23 16:20:28,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-23 16:20:28,947 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-23 16:20:28,947 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-23 16:20:28,949 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-23 16:20:28,951 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 04:20:28" (1/1) ... [2022-02-23 16:20:28,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.02 04:20:28 BasicIcfg [2022-02-23 16:20:28,964 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-23 16:20:28,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-23 16:20:28,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-23 16:20:28,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-23 16:20:28,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.02 04:20:28" (1/4) ... [2022-02-23 16:20:28,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64fe253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 04:20:28, skipping insertion in model container [2022-02-23 16:20:28,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 04:20:28" (2/4) ... [2022-02-23 16:20:28,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64fe253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 04:20:28, skipping insertion in model container [2022-02-23 16:20:28,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 04:20:28" (3/4) ... [2022-02-23 16:20:28,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64fe253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.02 04:20:28, skipping insertion in model container [2022-02-23 16:20:28,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.02 04:20:28" (4/4) ... [2022-02-23 16:20:28,970 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.cJordan [2022-02-23 16:20:28,973 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-23 16:20:28,973 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-23 16:20:29,009 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-23 16:20:29,017 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-23 16:20:29,017 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-23 16:20:29,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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-23 16:20:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-23 16:20:29,043 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:20:29,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:20:29,044 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:20:29,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:20:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash -756157467, now seen corresponding path program 1 times [2022-02-23 16:20:29,054 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:20:29,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898977736] [2022-02-23 16:20:29,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:20:29,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:20:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:29,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:20:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:29,193 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-23 16:20:29,193 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:20:29,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898977736] [2022-02-23 16:20:29,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898977736] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:20:29,194 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 16:20:29,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-23 16:20:29,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924291178] [2022-02-23 16:20:29,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:20:29,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-23 16:20:29,198 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:20:29,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-23 16:20:29,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-23 16:20:29,232 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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-23 16:20:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:20:29,258 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-23 16:20:29,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-23 16:20:29,261 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-23 16:20:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:20:29,265 INFO L225 Difference]: With dead ends: 19 [2022-02-23 16:20:29,265 INFO L226 Difference]: Without dead ends: 13 [2022-02-23 16:20:29,267 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-23 16:20:29,269 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 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-23 16:20:29,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 16:20:29,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-23 16:20:29,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-23 16:20:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-23 16:20:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-02-23 16:20:29,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-02-23 16:20:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:20:29,293 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-02-23 16:20:29,293 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-23 16:20:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-02-23 16:20:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-23 16:20:29,294 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:20:29,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:20:29,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-23 16:20:29,294 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:20:29,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:20:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash -755233946, now seen corresponding path program 1 times [2022-02-23 16:20:29,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:20:29,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577890378] [2022-02-23 16:20:29,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:20:29,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:20:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:29,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:20:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:29,423 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-23 16:20:29,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:20:29,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577890378] [2022-02-23 16:20:29,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577890378] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 16:20:29,424 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 16:20:29,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-23 16:20:29,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694543404] [2022-02-23 16:20:29,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 16:20:29,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-23 16:20:29,425 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:20:29,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-23 16:20:29,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-23 16:20:29,426 INFO L87 Difference]: Start difference. First operand 13 states and 14 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-23 16:20:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:20:29,458 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-23 16:20:29,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-23 16:20:29,459 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-23 16:20:29,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:20:29,459 INFO L225 Difference]: With dead ends: 15 [2022-02-23 16:20:29,460 INFO L226 Difference]: Without dead ends: 15 [2022-02-23 16:20:29,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-23 16:20:29,465 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:20:29,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 16:20:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-23 16:20:29,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-23 16:20:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-23 16:20:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-02-23 16:20:29,472 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-02-23 16:20:29,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:20:29,473 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-02-23 16:20:29,473 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-23 16:20:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-23 16:20:29,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-23 16:20:29,474 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:20:29,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:20:29,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-23 16:20:29,477 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:20:29,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:20:29,481 INFO L85 PathProgramCache]: Analyzing trace with hash 980092676, now seen corresponding path program 1 times [2022-02-23 16:20:29,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:20:29,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268512907] [2022-02-23 16:20:29,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:20:29,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:20:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:29,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:20:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:29,571 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-23 16:20:29,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:20:29,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268512907] [2022-02-23 16:20:29,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268512907] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:20:29,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948565352] [2022-02-23 16:20:29,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:20:29,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:20:29,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:20:29,584 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-23 16:20:29,586 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-23 16:20:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:29,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-23 16:20:29,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:20:29,687 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-23 16:20:29,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:20:29,831 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-23 16:20:29,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948565352] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 16:20:29,833 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 16:20:29,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 7] total 11 [2022-02-23 16:20:29,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597384684] [2022-02-23 16:20:29,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 16:20:29,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-23 16:20:29,836 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:20:29,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-23 16:20:29,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-23 16:20:29,837 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-23 16:20:29,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:20:29,941 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-23 16:20:29,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-23 16:20:29,942 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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 13 [2022-02-23 16:20:29,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:20:29,943 INFO L225 Difference]: With dead ends: 18 [2022-02-23 16:20:29,943 INFO L226 Difference]: Without dead ends: 18 [2022-02-23 16:20:29,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-02-23 16:20:29,944 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:20:29,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 16:20:29,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-23 16:20:29,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-23 16:20:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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-23 16:20:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-02-23 16:20:29,947 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-02-23 16:20:29,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:20:29,948 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-02-23 16:20:29,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-23 16:20:29,948 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-23 16:20:29,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-23 16:20:29,949 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:20:29,949 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:20:29,990 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-23 16:20:30,167 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-23 16:20:30,168 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:20:30,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:20:30,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1575643231, now seen corresponding path program 1 times [2022-02-23 16:20:30,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:20:30,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417991051] [2022-02-23 16:20:30,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:20:30,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:20:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:30,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:20:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:20:30,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:20:30,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417991051] [2022-02-23 16:20:30,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417991051] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:20:30,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788479527] [2022-02-23 16:20:30,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:20:30,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:20:30,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:20:30,232 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-23 16:20:30,233 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-23 16:20:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:30,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-23 16:20:30,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:20:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:20:30,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:20:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:20:30,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788479527] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 16:20:30,456 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 16:20:30,456 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-02-23 16:20:30,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072009602] [2022-02-23 16:20:30,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 16:20:30,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-23 16:20:30,456 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:20:30,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-23 16:20:30,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-23 16:20:30,457 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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-23 16:20:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:20:30,651 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-23 16:20:30,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-23 16:20:30,651 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 17 [2022-02-23 16:20:30,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:20:30,652 INFO L225 Difference]: With dead ends: 26 [2022-02-23 16:20:30,652 INFO L226 Difference]: Without dead ends: 26 [2022-02-23 16:20:30,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2022-02-23 16:20:30,653 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 16:20:30,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 29 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 16:20:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-23 16:20:30,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-23 16:20:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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-23 16:20:30,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-02-23 16:20:30,655 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 17 [2022-02-23 16:20:30,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:20:30,656 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-23 16:20:30,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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-23 16:20:30,656 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-23 16:20:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-23 16:20:30,656 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:20:30,656 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:20:30,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-23 16:20:30,868 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-23 16:20:30,868 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:20:30,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:20:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash 109985751, now seen corresponding path program 2 times [2022-02-23 16:20:30,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:20:30,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620656095] [2022-02-23 16:20:30,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:20:30,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:20:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:31,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:20:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:20:31,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:20:31,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620656095] [2022-02-23 16:20:31,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620656095] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:20:31,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207237776] [2022-02-23 16:20:31,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 16:20:31,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:20:31,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:20:31,017 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-23 16:20:31,018 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-23 16:20:31,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 16:20:31,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 16:20:31,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-23 16:20:31,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:20:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:20:31,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:20:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 16:20:31,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207237776] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 16:20:31,437 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 16:20:31,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 23 [2022-02-23 16:20:31,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917600694] [2022-02-23 16:20:31,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 16:20:31,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-23 16:20:31,438 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:20:31,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-23 16:20:31,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-02-23 16:20:31,438 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 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-23 16:20:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:20:32,532 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-23 16:20:32,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-23 16:20:32,532 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 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 25 [2022-02-23 16:20:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:20:32,534 INFO L225 Difference]: With dead ends: 39 [2022-02-23 16:20:32,534 INFO L226 Difference]: Without dead ends: 36 [2022-02-23 16:20:32,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=311, Invalid=1095, Unknown=0, NotChecked=0, Total=1406 [2022-02-23 16:20:32,535 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-23 16:20:32,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 66 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-23 16:20:32,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-23 16:20:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-23 16:20:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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-23 16:20:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-02-23 16:20:32,539 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2022-02-23 16:20:32,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:20:32,539 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-02-23 16:20:32,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 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-23 16:20:32,539 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-23 16:20:32,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-23 16:20:32,540 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:20:32,540 INFO L514 BasicCegarLoop]: trace histogram [12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:20:32,557 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-23 16:20:32,757 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-23 16:20:32,758 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:20:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:20:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash 134643049, now seen corresponding path program 3 times [2022-02-23 16:20:32,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:20:32,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825290457] [2022-02-23 16:20:32,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:20:32,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:20:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:32,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:20:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-23 16:20:32,895 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:20:32,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825290457] [2022-02-23 16:20:32,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825290457] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:20:32,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042583496] [2022-02-23 16:20:32,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-23 16:20:32,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:20:32,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:20:32,897 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-23 16:20:32,898 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-23 16:20:32,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-02-23 16:20:32,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 16:20:32,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-23 16:20:33,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:20:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-23 16:20:33,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:20:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-23 16:20:33,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042583496] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 16:20:33,639 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 16:20:33,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 12] total 27 [2022-02-23 16:20:33,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722952180] [2022-02-23 16:20:33,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 16:20:33,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-23 16:20:33,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:20:33,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-23 16:20:33,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2022-02-23 16:20:33,641 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 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-23 16:20:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:20:37,034 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-02-23 16:20:37,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-23 16:20:37,034 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 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 35 [2022-02-23 16:20:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:20:37,035 INFO L225 Difference]: With dead ends: 57 [2022-02-23 16:20:37,035 INFO L226 Difference]: Without dead ends: 54 [2022-02-23 16:20:37,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=563, Invalid=2089, Unknown=0, NotChecked=0, Total=2652 [2022-02-23 16:20:37,037 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-23 16:20:37,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 66 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-23 16:20:37,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-23 16:20:37,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-02-23 16:20:37,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 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-23 16:20:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-02-23 16:20:37,041 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 35 [2022-02-23 16:20:37,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:20:37,041 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-02-23 16:20:37,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 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-23 16:20:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-02-23 16:20:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-23 16:20:37,042 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:20:37,042 INFO L514 BasicCegarLoop]: trace histogram [20, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:20:37,047 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-23 16:20:37,243 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-23 16:20:37,243 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:20:37,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:20:37,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1228107086, now seen corresponding path program 4 times [2022-02-23 16:20:37,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:20:37,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94620818] [2022-02-23 16:20:37,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:20:37,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:20:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:37,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:20:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:20:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-02-23 16:20:37,388 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:20:37,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94620818] [2022-02-23 16:20:37,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94620818] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:20:37,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736585042] [2022-02-23 16:20:37,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-23 16:20:37,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:20:37,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:20:37,391 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-23 16:20:37,392 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-23 16:20:37,434 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-23 16:20:37,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 16:20:37,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-23 16:20:37,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:20:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-23 16:20:37,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:20:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-23 16:20:38,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736585042] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 16:20:38,390 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 16:20:38,390 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 19] total 37 [2022-02-23 16:20:38,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600127101] [2022-02-23 16:20:38,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 16:20:38,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-02-23 16:20:38,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:20:38,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-02-23 16:20:38,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=962, Unknown=0, NotChecked=0, Total=1332 [2022-02-23 16:20:38,392 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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-23 16:21:03,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 16:21:03,097 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-02-23 16:21:03,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-23 16:21:03,097 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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 51 [2022-02-23 16:21:03,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 16:21:03,098 INFO L225 Difference]: With dead ends: 86 [2022-02-23 16:21:03,098 INFO L226 Difference]: Without dead ends: 86 [2022-02-23 16:21:03,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=1061, Invalid=2845, Unknown=0, NotChecked=0, Total=3906 [2022-02-23 16:21:03,099 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-23 16:21:03,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 104 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-23 16:21:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-23 16:21:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-02-23 16:21:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 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-23 16:21:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-02-23 16:21:03,104 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 51 [2022-02-23 16:21:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 16:21:03,104 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-02-23 16:21:03,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 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-23 16:21:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-02-23 16:21:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-23 16:21:03,105 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 16:21:03,105 INFO L514 BasicCegarLoop]: trace histogram [37, 25, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 16:21:03,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-23 16:21:03,305 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-23 16:21:03,305 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 16:21:03,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 16:21:03,306 INFO L85 PathProgramCache]: Analyzing trace with hash 525547056, now seen corresponding path program 5 times [2022-02-23 16:21:03,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 16:21:03,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005053222] [2022-02-23 16:21:03,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 16:21:03,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 16:21:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:21:03,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 16:21:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 16:21:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 598 proven. 650 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-02-23 16:21:03,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 16:21:03,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005053222] [2022-02-23 16:21:03,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005053222] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 16:21:03,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901666040] [2022-02-23 16:21:03,813 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-23 16:21:03,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 16:21:03,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 16:21:03,814 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-23 16:21:03,815 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-23 16:21:12,181 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2022-02-23 16:21:12,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 16:21:12,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 66 conjunts are in the unsatisfiable core [2022-02-23 16:21:12,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 16:21:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 352 proven. 992 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-23 16:21:12,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 16:21:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 352 proven. 992 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-23 16:21:14,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901666040] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 16:21:14,956 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 16:21:14,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 34, 35] total 69 [2022-02-23 16:21:14,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728470335] [2022-02-23 16:21:14,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 16:21:14,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-02-23 16:21:14,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 16:21:14,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-02-23 16:21:14,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1251, Invalid=3441, Unknown=0, NotChecked=0, Total=4692 [2022-02-23 16:21:14,958 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 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-23 16:21:50,154 WARN L232 SmtUtils]: Spent 10.30s on a formula simplification. DAG size of input: 230 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:22:23,106 WARN L232 SmtUtils]: Spent 7.83s on a formula simplification. DAG size of input: 223 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:23:02,505 WARN L232 SmtUtils]: Spent 9.11s on a formula simplification. DAG size of input: 216 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:23:40,093 WARN L232 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 209 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:24:49,067 WARN L232 SmtUtils]: Spent 9.55s on a formula simplification. DAG size of input: 195 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:25:22,918 WARN L232 SmtUtils]: Spent 5.98s on a formula simplification. DAG size of input: 188 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:25:24,939 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse22 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000))))) is different from false [2022-02-23 16:25:26,948 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse22 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000))))) is different from false [2022-02-23 16:26:51,636 WARN L232 SmtUtils]: Spent 6.92s on a formula simplification. DAG size of input: 167 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:27:40,138 WARN L232 SmtUtils]: Spent 18.46s on a formula simplification. DAG size of input: 200 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:29:24,764 WARN L232 SmtUtils]: Spent 42.65s on a formula simplification. DAG size of input: 207 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:30:56,582 WARN L232 SmtUtils]: Spent 39.08s on a formula simplification. DAG size of input: 214 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:30:58,611 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse18 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000))))) is different from false [2022-02-23 16:32:07,133 WARN L232 SmtUtils]: Spent 35.80s on a formula simplification. DAG size of input: 221 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:32:09,148 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse18 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000))))) is different from false [2022-02-23 16:33:21,710 WARN L232 SmtUtils]: Spent 22.81s on a formula simplification. DAG size of input: 228 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-23 16:35:00,983 WARN L232 SmtUtils]: Spent 40.12s on a formula simplification. DAG size of input: 233 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)