/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-18 12:41:52,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-18 12:41:52,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-18 12:41:52,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-18 12:41:52,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-18 12:41:52,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-18 12:41:52,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-18 12:41:52,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-18 12:41:52,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-18 12:41:52,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-18 12:41:52,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-18 12:41:52,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-18 12:41:52,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-18 12:41:52,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-18 12:41:52,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-18 12:41:52,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-18 12:41:52,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-18 12:41:52,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-18 12:41:52,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-18 12:41:52,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-18 12:41:52,065 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-18 12:41:52,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-18 12:41:52,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-18 12:41:52,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-18 12:41:52,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-18 12:41:52,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-18 12:41:52,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-18 12:41:52,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-18 12:41:52,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-18 12:41:52,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-18 12:41:52,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-18 12:41:52,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-18 12:41:52,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-18 12:41:52,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-18 12:41:52,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-18 12:41:52,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-18 12:41:52,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-18 12:41:52,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-18 12:41:52,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-18 12:41:52,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-18 12:41:52,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-18 12:41:52,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-18 12:41:52,085 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-03-18 12:41:52,106 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-18 12:41:52,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-18 12:41:52,107 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-18 12:41:52,107 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-18 12:41:52,107 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-18 12:41:52,107 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-18 12:41:52,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-18 12:41:52,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-18 12:41:52,108 INFO L138 SettingsManager]: * Use SBE=true [2022-03-18 12:41:52,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-18 12:41:52,108 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-18 12:41:52,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-18 12:41:52,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-18 12:41:52,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-18 12:41:52,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-18 12:41:52,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-18 12:41:52,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-18 12:41:52,108 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-18 12:41:52,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-18 12:41:52,109 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-18 12:41:52,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-18 12:41:52,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-18 12:41:52,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-18 12:41:52,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-18 12:41:52,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 12:41:52,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-18 12:41:52,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-18 12:41:52,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-18 12:41:52,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-18 12:41:52,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-18 12:41:52,109 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-18 12:41:52,110 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-18 12:41:52,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-18 12:41:52,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-03-18 12:41:52,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-18 12:41:52,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-18 12:41:52,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-18 12:41:52,327 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-18 12:41:52,327 INFO L275 PluginConnector]: CDTParser initialized [2022-03-18 12:41:52,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c [2022-03-18 12:41:52,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26fd464ae/0fc3cf33f7ca45879c109126f9371f49/FLAGef22dfdb0 [2022-03-18 12:41:52,683 INFO L306 CDTParser]: Found 1 translation units. [2022-03-18 12:41:52,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c [2022-03-18 12:41:52,692 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26fd464ae/0fc3cf33f7ca45879c109126f9371f49/FLAGef22dfdb0 [2022-03-18 12:41:53,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26fd464ae/0fc3cf33f7ca45879c109126f9371f49 [2022-03-18 12:41:53,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-18 12:41:53,123 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-18 12:41:53,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-18 12:41:53,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-18 12:41:53,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-18 12:41:53,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 12:41:53" (1/1) ... [2022-03-18 12:41:53,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5160d556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:41:53, skipping insertion in model container [2022-03-18 12:41:53,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 12:41:53" (1/1) ... [2022-03-18 12:41:53,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-18 12:41:53,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-18 12:41:53,274 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/mono-crafted_10.c[319,332] [2022-03-18 12:41:53,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 12:41:53,296 INFO L203 MainTranslator]: Completed pre-run [2022-03-18 12:41:53,304 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/mono-crafted_10.c[319,332] [2022-03-18 12:41:53,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 12:41:53,314 INFO L208 MainTranslator]: Completed translation [2022-03-18 12:41:53,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:41:53 WrapperNode [2022-03-18 12:41:53,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-18 12:41:53,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-18 12:41:53,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-18 12:41:53,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-18 12:41:53,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:41:53" (1/1) ... [2022-03-18 12:41:53,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:41:53" (1/1) ... [2022-03-18 12:41:53,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:41:53" (1/1) ... [2022-03-18 12:41:53,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:41:53" (1/1) ... [2022-03-18 12:41:53,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:41:53" (1/1) ... [2022-03-18 12:41:53,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:41:53" (1/1) ... [2022-03-18 12:41:53,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:41:53" (1/1) ... [2022-03-18 12:41:53,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-18 12:41:53,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-18 12:41:53,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-18 12:41:53,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-18 12:41:53,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:41:53" (1/1) ... [2022-03-18 12:41:53,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 12:41:53,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 12:41:53,360 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-03-18 12:41:53,375 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-03-18 12:41:53,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-18 12:41:53,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-18 12:41:53,406 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-18 12:41:53,406 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-18 12:41:53,407 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-18 12:41:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-18 12:41:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-18 12:41:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-18 12:41:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-18 12:41:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-18 12:41:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-18 12:41:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-18 12:41:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-18 12:41:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-18 12:41:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-18 12:41:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-18 12:41:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-18 12:41:53,456 INFO L234 CfgBuilder]: Building ICFG [2022-03-18 12:41:53,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-18 12:41:53,578 INFO L275 CfgBuilder]: Performing block encoding [2022-03-18 12:41:53,582 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-18 12:41:53,582 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-18 12:41:53,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 12:41:53 BoogieIcfgContainer [2022-03-18 12:41:53,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-18 12:41:53,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-18 12:41:53,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-18 12:41:53,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-18 12:41:53,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.03 12:41:53" (1/3) ... [2022-03-18 12:41:53,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8f3534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 12:41:53, skipping insertion in model container [2022-03-18 12:41:53,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 12:41:53" (2/3) ... [2022-03-18 12:41:53,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8f3534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 12:41:53, skipping insertion in model container [2022-03-18 12:41:53,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 12:41:53" (3/3) ... [2022-03-18 12:41:53,589 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_10.c [2022-03-18 12:41:53,592 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-18 12:41:53,592 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-18 12:41:53,656 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-18 12:41:53,660 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-18 12:41:53,661 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-18 12:41:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-03-18 12:41:53,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-18 12:41:53,683 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:41:53,684 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:41:53,684 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:41:53,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:41:53,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 1 times [2022-03-18 12:41:53,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:41:53,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246527001] [2022-03-18 12:41:53,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:41:53,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:41:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:41:53,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:41:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:41:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:41:53,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:41:53,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246527001] [2022-03-18 12:41:53,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246527001] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:41:53,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:41:53,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-18 12:41:53,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501834975] [2022-03-18 12:41:53,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:41:53,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-18 12:41:53,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:41:53,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-18 12:41:53,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-18 12:41:53,869 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-03-18 12:41:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:41:53,897 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-03-18 12:41:53,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-18 12:41:53,900 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-03-18 12:41:53,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:41:53,908 INFO L225 Difference]: With dead ends: 33 [2022-03-18 12:41:53,908 INFO L226 Difference]: Without dead ends: 14 [2022-03-18 12:41:53,910 INFO L911 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-03-18 12:41:53,915 INFO L912 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 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-03-18 12:41:53,916 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 12:41:53,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-03-18 12:41:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-03-18 12:41:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 12:41:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-03-18 12:41:53,936 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-03-18 12:41:53,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:41:53,936 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-03-18 12:41:53,937 INFO L479 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-03-18 12:41:53,937 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-03-18 12:41:53,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-18 12:41:53,937 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:41:53,937 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:41:53,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-18 12:41:53,938 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:41:53,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:41:53,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 1 times [2022-03-18 12:41:53,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:41:53,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588717910] [2022-03-18 12:41:53,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:41:53,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:41:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:41:54,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:41:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:41:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:41:54,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:41:54,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588717910] [2022-03-18 12:41:54,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588717910] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 12:41:54,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 12:41:54,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 12:41:54,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903175222] [2022-03-18 12:41:54,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 12:41:54,084 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 12:41:54,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:41:54,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 12:41:54,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 12:41:54,085 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 12:41:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:41:54,123 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-03-18 12:41:54,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 12:41:54,123 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-03-18 12:41:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:41:54,124 INFO L225 Difference]: With dead ends: 25 [2022-03-18 12:41:54,124 INFO L226 Difference]: Without dead ends: 17 [2022-03-18 12:41:54,124 INFO L911 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-03-18 12:41:54,125 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 12:41:54,126 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 12:41:54,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-03-18 12:41:54,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-03-18 12:41:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 12:41:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-03-18 12:41:54,129 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-03-18 12:41:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:41:54,130 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-03-18 12:41:54,130 INFO L479 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-03-18 12:41:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-03-18 12:41:54,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-18 12:41:54,130 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:41:54,130 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:41:54,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-18 12:41:54,131 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:41:54,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:41:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash -79339060, now seen corresponding path program 1 times [2022-03-18 12:41:54,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:41:54,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9174225] [2022-03-18 12:41:54,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:41:54,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:41:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:41:54,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:41:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:41:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:41:54,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:41:54,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9174225] [2022-03-18 12:41:54,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9174225] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 12:41:54,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067706832] [2022-03-18 12:41:54,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:41:54,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 12:41:54,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 12:41:54,280 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-03-18 12:41:54,281 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-03-18 12:41:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:41:54,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-18 12:41:54,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 12:41:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:41:54,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 12:41:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:41:54,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067706832] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 12:41:54,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 12:41:54,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-03-18 12:41:54,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017191881] [2022-03-18 12:41:54,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 12:41:54,543 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-18 12:41:54,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:41:54,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-18 12:41:54,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-18 12:41:54,544 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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-03-18 12:41:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:41:54,652 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-03-18 12:41:54,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-18 12:41:54,652 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 14 [2022-03-18 12:41:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:41:54,653 INFO L225 Difference]: With dead ends: 32 [2022-03-18 12:41:54,653 INFO L226 Difference]: Without dead ends: 24 [2022-03-18 12:41:54,653 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-03-18 12:41:54,654 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 12:41:54,654 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 28 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 12:41:54,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-03-18 12:41:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-03-18 12:41:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-03-18 12:41:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-03-18 12:41:54,659 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2022-03-18 12:41:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:41:54,659 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-03-18 12:41:54,659 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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-03-18 12:41:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-03-18 12:41:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-18 12:41:54,660 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:41:54,660 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:41:54,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-18 12:41:54,875 WARN L460 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-03-18 12:41:54,876 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:41:54,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:41:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1341602340, now seen corresponding path program 1 times [2022-03-18 12:41:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:41:54,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721197609] [2022-03-18 12:41:54,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:41:54,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:41:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:41:54,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:41:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:41:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 12:41:54,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:41:54,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721197609] [2022-03-18 12:41:54,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721197609] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 12:41:54,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666752939] [2022-03-18 12:41:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:41:54,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 12:41:54,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 12:41:54,978 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-03-18 12:41:54,980 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-03-18 12:41:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:41:55,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-18 12:41:55,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 12:41:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 12:41:55,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 12:41:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:41:55,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666752939] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 12:41:55,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 12:41:55,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 15 [2022-03-18 12:41:55,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434224666] [2022-03-18 12:41:55,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 12:41:55,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-18 12:41:55,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:41:55,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-18 12:41:55,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-03-18 12:41:55,308 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 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-03-18 12:41:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:41:56,346 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2022-03-18 12:41:56,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-18 12:41:56,346 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 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 23 [2022-03-18 12:41:56,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:41:56,348 INFO L225 Difference]: With dead ends: 50 [2022-03-18 12:41:56,348 INFO L226 Difference]: Without dead ends: 40 [2022-03-18 12:41:56,348 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=587, Unknown=0, NotChecked=0, Total=812 [2022-03-18 12:41:56,349 INFO L912 BasicCegarLoop]: 10 mSDtfsCounter, 95 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 12:41:56,349 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 47 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 12:41:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-18 12:41:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2022-03-18 12:41:56,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 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-03-18 12:41:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-03-18 12:41:56,360 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2022-03-18 12:41:56,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:41:56,361 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-03-18 12:41:56,361 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 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-03-18 12:41:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-03-18 12:41:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-18 12:41:56,361 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:41:56,362 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:41:56,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-18 12:41:56,578 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-18 12:41:56,578 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:41:56,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:41:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash 948575330, now seen corresponding path program 2 times [2022-03-18 12:41:56,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:41:56,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003710394] [2022-03-18 12:41:56,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:41:56,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:41:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:41:56,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:41:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:41:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:41:56,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:41:56,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003710394] [2022-03-18 12:41:56,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003710394] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 12:41:56,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558914253] [2022-03-18 12:41:56,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 12:41:56,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 12:41:56,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 12:41:56,650 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-03-18 12:41:56,651 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-03-18 12:41:56,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 12:41:56,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 12:41:56,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-18 12:41:56,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 12:41:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:41:56,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 12:41:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:41:56,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558914253] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 12:41:56,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 12:41:56,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 18 [2022-03-18 12:41:56,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523084124] [2022-03-18 12:41:56,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 12:41:56,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-18 12:41:56,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:41:56,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-18 12:41:56,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2022-03-18 12:41:56,993 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 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-03-18 12:41:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:41:58,138 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2022-03-18 12:41:58,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-18 12:41:58,139 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 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 23 [2022-03-18 12:41:58,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:41:58,140 INFO L225 Difference]: With dead ends: 79 [2022-03-18 12:41:58,140 INFO L226 Difference]: Without dead ends: 65 [2022-03-18 12:41:58,141 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=305, Invalid=751, Unknown=0, NotChecked=0, Total=1056 [2022-03-18 12:41:58,141 INFO L912 BasicCegarLoop]: 10 mSDtfsCounter, 91 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:41:58,142 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 57 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:41:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-03-18 12:41:58,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2022-03-18 12:41:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 56 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 12:41:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2022-03-18 12:41:58,149 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 23 [2022-03-18 12:41:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:41:58,149 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2022-03-18 12:41:58,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 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-03-18 12:41:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-03-18 12:41:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-18 12:41:58,150 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:41:58,150 INFO L500 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:41:58,170 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-03-18 12:41:58,368 WARN L460 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-03-18 12:41:58,369 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:41:58,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:41:58,369 INFO L85 PathProgramCache]: Analyzing trace with hash 121899492, now seen corresponding path program 2 times [2022-03-18 12:41:58,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:41:58,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505903325] [2022-03-18 12:41:58,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:41:58,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:41:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:41:58,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:41:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:41:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:41:58,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:41:58,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505903325] [2022-03-18 12:41:58,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505903325] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 12:41:58,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734382275] [2022-03-18 12:41:58,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 12:41:58,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 12:41:58,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 12:41:58,533 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-03-18 12:41:58,534 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-03-18 12:41:58,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 12:41:58,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 12:41:58,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-18 12:41:58,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 12:41:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:41:58,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 12:41:59,080 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 12:41:59,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734382275] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 12:41:59,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 12:41:59,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 12] total 28 [2022-03-18 12:41:59,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857843291] [2022-03-18 12:41:59,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 12:41:59,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-18 12:41:59,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:41:59,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-18 12:41:59,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2022-03-18 12:41:59,082 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 26 states have internal predecessors, (68), 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-03-18 12:42:05,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-18 12:42:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:42:09,391 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2022-03-18 12:42:09,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-18 12:42:09,392 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 26 states have internal predecessors, (68), 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 29 [2022-03-18 12:42:09,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:42:09,392 INFO L225 Difference]: With dead ends: 101 [2022-03-18 12:42:09,392 INFO L226 Difference]: Without dead ends: 57 [2022-03-18 12:42:09,394 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=506, Invalid=2044, Unknown=0, NotChecked=0, Total=2550 [2022-03-18 12:42:09,394 INFO L912 BasicCegarLoop]: 9 mSDtfsCounter, 91 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-18 12:42:09,394 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 56 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-18 12:42:09,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-03-18 12:42:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2022-03-18 12:42:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 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-03-18 12:42:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-03-18 12:42:09,400 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 29 [2022-03-18 12:42:09,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:42:09,400 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-03-18 12:42:09,400 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 26 states have internal predecessors, (68), 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-03-18 12:42:09,401 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-03-18 12:42:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-18 12:42:09,401 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:42:09,401 INFO L500 BasicCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:42:09,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-18 12:42:09,603 WARN L460 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-03-18 12:42:09,603 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:42:09,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:42:09,604 INFO L85 PathProgramCache]: Analyzing trace with hash -86495988, now seen corresponding path program 3 times [2022-03-18 12:42:09,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:42:09,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365514224] [2022-03-18 12:42:09,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:42:09,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:42:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:42:09,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:42:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:42:09,724 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 38 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 12:42:09,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:42:09,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365514224] [2022-03-18 12:42:09,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365514224] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 12:42:09,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501138623] [2022-03-18 12:42:09,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 12:42:09,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 12:42:09,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 12:42:09,726 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-03-18 12:42:09,727 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-03-18 12:42:09,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-18 12:42:09,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 12:42:09,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-18 12:42:09,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 12:42:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 53 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-03-18 12:42:09,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 12:42:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-03-18 12:42:10,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501138623] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 12:42:10,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 12:42:10,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 24 [2022-03-18 12:42:10,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168921998] [2022-03-18 12:42:10,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 12:42:10,233 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-18 12:42:10,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:42:10,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-18 12:42:10,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-03-18 12:42:10,234 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 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-03-18 12:42:11,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:42:11,119 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2022-03-18 12:42:11,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-18 12:42:11,120 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 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 38 [2022-03-18 12:42:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:42:11,121 INFO L225 Difference]: With dead ends: 85 [2022-03-18 12:42:11,121 INFO L226 Difference]: Without dead ends: 75 [2022-03-18 12:42:11,121 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=458, Invalid=1348, Unknown=0, NotChecked=0, Total=1806 [2022-03-18 12:42:11,122 INFO L912 BasicCegarLoop]: 10 mSDtfsCounter, 193 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-18 12:42:11,122 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 77 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-18 12:42:11,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-03-18 12:42:11,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2022-03-18 12:42:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 states have internal predecessors, (61), 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-03-18 12:42:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2022-03-18 12:42:11,128 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 38 [2022-03-18 12:42:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:42:11,128 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2022-03-18 12:42:11,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 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-03-18 12:42:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-03-18 12:42:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-18 12:42:11,129 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:42:11,129 INFO L500 BasicCegarLoop]: trace histogram [16, 16, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:42:11,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-18 12:42:11,343 WARN L460 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-03-18 12:42:11,343 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:42:11,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:42:11,344 INFO L85 PathProgramCache]: Analyzing trace with hash 809412770, now seen corresponding path program 4 times [2022-03-18 12:42:11,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:42:11,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527449478] [2022-03-18 12:42:11,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:42:11,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:42:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:42:11,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:42:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:42:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 193 proven. 126 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-03-18 12:42:11,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:42:11,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527449478] [2022-03-18 12:42:11,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527449478] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 12:42:11,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336690323] [2022-03-18 12:42:11,485 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-18 12:42:11,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 12:42:11,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 12:42:11,486 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-03-18 12:42:11,487 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-03-18 12:42:11,519 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-18 12:42:11,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 12:42:11,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-18 12:42:11,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 12:42:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 163 proven. 187 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-18 12:42:11,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 12:42:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 163 proven. 187 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-18 12:42:12,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336690323] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 12:42:12,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 12:42:12,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 29 [2022-03-18 12:42:12,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674129266] [2022-03-18 12:42:12,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 12:42:12,131 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-18 12:42:12,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:42:12,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-18 12:42:12,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2022-03-18 12:42:12,132 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 29 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 28 states have internal predecessors, (85), 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-03-18 12:42:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:42:17,615 INFO L93 Difference]: Finished difference Result 133 states and 158 transitions. [2022-03-18 12:42:17,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-18 12:42:17,616 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 28 states have internal predecessors, (85), 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 59 [2022-03-18 12:42:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:42:17,617 INFO L225 Difference]: With dead ends: 133 [2022-03-18 12:42:17,617 INFO L226 Difference]: Without dead ends: 105 [2022-03-18 12:42:17,617 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=785, Invalid=1971, Unknown=0, NotChecked=0, Total=2756 [2022-03-18 12:42:17,618 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 155 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 12:42:17,618 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 104 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-18 12:42:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-03-18 12:42:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-03-18 12:42:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.06) internal successors, (106), 100 states have internal predecessors, (106), 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-03-18 12:42:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2022-03-18 12:42:17,631 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 59 [2022-03-18 12:42:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:42:17,632 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2022-03-18 12:42:17,632 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 28 states have internal predecessors, (85), 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-03-18 12:42:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-03-18 12:42:17,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-03-18 12:42:17,636 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:42:17,636 INFO L500 BasicCegarLoop]: trace histogram [31, 31, 24, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:42:17,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-18 12:42:17,848 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 12:42:17,848 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:42:17,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:42:17,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1505006730, now seen corresponding path program 5 times [2022-03-18 12:42:17,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:42:17,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401980999] [2022-03-18 12:42:17,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:42:17,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:42:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:42:18,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:42:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:42:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 493 proven. 876 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-03-18 12:42:18,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:42:18,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401980999] [2022-03-18 12:42:18,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401980999] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 12:42:18,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849769226] [2022-03-18 12:42:18,298 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-18 12:42:18,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 12:42:18,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 12:42:18,299 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 12:42:18,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-18 12:42:39,291 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2022-03-18 12:42:39,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 12:42:39,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-18 12:42:39,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 12:42:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 148 proven. 1276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 12:42:39,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 12:42:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 148 proven. 1276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 12:42:41,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849769226] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 12:42:41,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 12:42:41,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32, 33] total 65 [2022-03-18 12:42:41,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482496763] [2022-03-18 12:42:41,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 12:42:41,517 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-18 12:42:41,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:42:41,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-18 12:42:41,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1114, Invalid=3046, Unknown=0, NotChecked=0, Total=4160 [2022-03-18 12:42:41,519 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 65 states, 65 states have (on average 2.9692307692307693) internal successors, (193), 64 states have internal predecessors, (193), 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-03-18 12:43:30,358 WARN L232 SmtUtils]: Spent 5.45s on a formula simplification. DAG size of input: 210 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:43:58,858 WARN L232 SmtUtils]: Spent 7.27s on a formula simplification. DAG size of input: 203 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:49:03,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:49:03,381 INFO L93 Difference]: Finished difference Result 241 states and 287 transitions. [2022-03-18 12:49:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-18 12:49:03,382 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.9692307692307693) internal successors, (193), 64 states have internal predecessors, (193), 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 104 [2022-03-18 12:49:03,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:49:03,383 INFO L225 Difference]: With dead ends: 241 [2022-03-18 12:49:03,383 INFO L226 Difference]: Without dead ends: 213 [2022-03-18 12:49:03,385 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 381.6s TimeCoverageRelationStatistics Valid=4102, Invalid=11386, Unknown=12, NotChecked=0, Total=15500 [2022-03-18 12:49:03,386 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 471 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2827 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-18 12:49:03,386 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [471 Valid, 164 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2827 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-18 12:49:03,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-03-18 12:49:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-03-18 12:49:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.0288461538461537) internal successors, (214), 208 states have internal predecessors, (214), 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-03-18 12:49:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 218 transitions. [2022-03-18 12:49:03,404 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 218 transitions. Word has length 104 [2022-03-18 12:49:03,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:49:03,404 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 218 transitions. [2022-03-18 12:49:03,404 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.9692307692307693) internal successors, (193), 64 states have internal predecessors, (193), 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-03-18 12:49:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 218 transitions. [2022-03-18 12:49:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-03-18 12:49:03,406 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:49:03,406 INFO L500 BasicCegarLoop]: trace histogram [67, 67, 60, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:49:03,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-18 12:49:03,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 12:49:03,607 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:49:03,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:49:03,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1339738486, now seen corresponding path program 6 times [2022-03-18 12:49:03,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:49:03,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018174173] [2022-03-18 12:49:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:49:03,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:49:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:49:05,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:49:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:49:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 1213 proven. 5430 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-03-18 12:49:05,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:49:05,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018174173] [2022-03-18 12:49:05,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018174173] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 12:49:05,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099142408] [2022-03-18 12:49:05,403 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-18 12:49:05,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 12:49:05,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 12:49:05,404 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 12:49:05,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-18 12:49:08,415 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-03-18 12:49:08,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 12:49:08,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-18 12:49:08,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 12:49:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 1372 proven. 77 refuted. 0 times theorem prover too weak. 5251 trivial. 0 not checked. [2022-03-18 12:49:10,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 12:49:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 0 proven. 1449 refuted. 0 times theorem prover too weak. 5251 trivial. 0 not checked. [2022-03-18 12:49:13,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099142408] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 12:49:13,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 12:49:13,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 13, 16] total 89 [2022-03-18 12:49:13,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997095365] [2022-03-18 12:49:13,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 12:49:13,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-03-18 12:49:13,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:49:13,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-03-18 12:49:13,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=6769, Unknown=0, NotChecked=0, Total=7832 [2022-03-18 12:49:13,948 INFO L87 Difference]: Start difference. First operand 213 states and 218 transitions. Second operand has 89 states, 89 states have (on average 2.797752808988764) internal successors, (249), 88 states have internal predecessors, (249), 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-03-18 12:50:01,637 WARN L232 SmtUtils]: Spent 13.28s on a formula simplification. DAG size of input: 80 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:50:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 12:50:01,863 INFO L93 Difference]: Finished difference Result 278 states and 310 transitions. [2022-03-18 12:50:01,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-18 12:50:01,864 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 2.797752808988764) internal successors, (249), 88 states have internal predecessors, (249), 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 212 [2022-03-18 12:50:01,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 12:50:01,865 INFO L225 Difference]: With dead ends: 278 [2022-03-18 12:50:01,865 INFO L226 Difference]: Without dead ends: 250 [2022-03-18 12:50:01,869 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 397 SyntacticMatches, 6 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3680 ImplicationChecksByTransitivity, 45.1s TimeCoverageRelationStatistics Valid=3827, Invalid=25585, Unknown=0, NotChecked=0, Total=29412 [2022-03-18 12:50:01,870 INFO L912 BasicCegarLoop]: 10 mSDtfsCounter, 1260 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 13994 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 14483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 13994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-03-18 12:50:01,870 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [1260 Valid, 102 Invalid, 14483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 13994 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-03-18 12:50:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-03-18 12:50:01,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2022-03-18 12:50:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 244 states have (on average 1.0450819672131149) internal successors, (255), 244 states have internal predecessors, (255), 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-03-18 12:50:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 259 transitions. [2022-03-18 12:50:01,888 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 259 transitions. Word has length 212 [2022-03-18 12:50:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 12:50:01,889 INFO L478 AbstractCegarLoop]: Abstraction has 249 states and 259 transitions. [2022-03-18 12:50:01,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 2.797752808988764) internal successors, (249), 88 states have internal predecessors, (249), 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-03-18 12:50:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 259 transitions. [2022-03-18 12:50:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-03-18 12:50:01,891 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 12:50:01,891 INFO L500 BasicCegarLoop]: trace histogram [79, 79, 62, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 12:50:01,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-18 12:50:02,095 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-18 12:50:02,096 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 12:50:02,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 12:50:02,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1122914230, now seen corresponding path program 7 times [2022-03-18 12:50:02,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 12:50:02,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039270578] [2022-03-18 12:50:02,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 12:50:02,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 12:50:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:50:03,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 12:50:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:50:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 3133 proven. 5797 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-03-18 12:50:03,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 12:50:03,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039270578] [2022-03-18 12:50:03,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039270578] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 12:50:03,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557182968] [2022-03-18 12:50:03,911 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-18 12:50:03,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 12:50:03,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 12:50:03,912 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-18 12:50:03,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-18 12:50:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 12:50:04,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 158 conjunts are in the unsatisfiable core [2022-03-18 12:50:04,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 12:50:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 388 proven. 8932 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 12:50:05,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 12:50:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 388 proven. 8932 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 12:50:15,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557182968] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 12:50:15,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 12:50:15,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 80, 81] total 161 [2022-03-18 12:50:15,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060583528] [2022-03-18 12:50:15,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 12:50:15,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 161 states [2022-03-18 12:50:15,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 12:50:15,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2022-03-18 12:50:15,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6624, Invalid=19136, Unknown=0, NotChecked=0, Total=25760 [2022-03-18 12:50:15,677 INFO L87 Difference]: Start difference. First operand 249 states and 259 transitions. Second operand has 161 states, 161 states have (on average 2.987577639751553) internal successors, (481), 160 states have internal predecessors, (481), 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-03-18 12:50:25,524 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse1)) (<= 4294967295 .cse1))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse2 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ c_main_~x~0 75) 4294967296))) (or (not (<= 5000000 .cse3)) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ 17 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 63 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (<= 4294967295 .cse5))) (let ((.cse6 (mod (+ 14 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 51 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 52 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ c_main_~x~0 11) 4294967296))) (or (<= 4294967295 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ 7 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ 13 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse13)) (<= 4294967295 .cse13))) (let ((.cse14 (mod (+ 47 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ 72 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ 58 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse17)) (<= 4294967295 .cse17))) (let ((.cse18 (mod (+ 57 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse19)) (<= 4294967295 .cse19))) (let ((.cse20 (mod (+ 76 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse20)) (<= 4294967295 .cse20))) (let ((.cse21 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 3 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ 39 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ 65 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ 9 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ 67 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 50) 4294967296))) (or (<= 4294967295 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse28)) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ 74 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ 60 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse31)) (<= 4294967295 .cse31))) (let ((.cse32 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse32)) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ 53 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ c_main_~x~0 24) 4294967296))) (or (<= 4294967295 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ c_main_~x~0 1) 4294967296))) (or (not (<= 5000000 .cse35)) (<= 4294967295 .cse35))) (let ((.cse36 (mod (+ 16 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse37)) (<= 4294967295 .cse37))) (let ((.cse38 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse38)) (<= 4294967295 .cse38))) (let ((.cse39 (mod (+ 33 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse39) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ 6 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 21 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse41) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ 26 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse42) (not (<= 5000000 .cse42)))) (let ((.cse43 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse43)) (<= 4294967295 .cse43))) (let ((.cse44 (mod (+ c_main_~x~0 54) 4294967296))) (or (<= 4294967295 .cse44) (not (<= 5000000 .cse44)))) (let ((.cse45 (mod (+ 10 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse45) (not (<= 5000000 .cse45)))) (let ((.cse46 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (<= 4294967295 .cse46))) (let ((.cse47 (mod (+ c_main_~x~0 37) 4294967296))) (or (<= 4294967295 .cse47) (not (<= 5000000 .cse47)))) (let ((.cse48 (mod (+ 73 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse48) (not (<= 5000000 .cse48)))) (let ((.cse49 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse49)) (<= 4294967295 .cse49))) (let ((.cse50 (mod (+ 5 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse50)) (<= 4294967295 .cse50))) (let ((.cse51 (mod (+ 42 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse51) (not (<= 5000000 .cse51)))) (let ((.cse52 (mod (+ 4 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse52)) (<= 4294967295 .cse52))) (let ((.cse53 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse53)) (<= 4294967295 .cse53))) (let ((.cse54 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (<= 5000000 .cse54)) (<= 4294967295 .cse54))) (let ((.cse55 (mod (+ 48 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse55) (not (<= 5000000 .cse55)))) (let ((.cse56 (mod (+ 12 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse56)) (<= 4294967295 .cse56))) (let ((.cse57 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse57)) (<= 4294967295 .cse57))) (let ((.cse58 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse58)) (<= 4294967295 .cse58))) (let ((.cse59 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse59)) (<= 4294967295 .cse59))) (let ((.cse60 (mod (+ 62 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse60)) (<= 4294967295 .cse60))) (let ((.cse61 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse61)) (<= 4294967295 .cse61))) (let ((.cse62 (mod (+ 36 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse62) (not (<= 5000000 .cse62)))) (let ((.cse63 (mod (+ 22 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse63) (not (<= 5000000 .cse63)))) (not (<= 5000000 (mod c_main_~x~0 4294967296))) (let ((.cse64 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse64)) (<= 4294967295 .cse64))) (let ((.cse65 (mod (+ 70 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse65) (not (<= 5000000 .cse65)))) (let ((.cse66 (mod (+ 20 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse66) (not (<= 5000000 .cse66)))) (let ((.cse67 (mod (+ 29 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse67) (not (<= 5000000 .cse67)))) (let ((.cse68 (mod (+ 69 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse68) (not (<= 5000000 .cse68)))) (let ((.cse69 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse69)) (<= 4294967295 .cse69))) (let ((.cse70 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse70)) (<= 4294967295 .cse70))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse71 (mod (+ 8 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse71) (not (<= 5000000 .cse71)))) (let ((.cse72 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse72)) (<= 4294967295 .cse72))) (let ((.cse73 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse73)) (<= 4294967295 .cse73))) (let ((.cse74 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse74)) (<= 4294967295 .cse74))) (let ((.cse75 (mod (+ 15 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse75) (not (<= 5000000 .cse75)))) (let ((.cse76 (mod (+ c_main_~x~0 61) 4294967296))) (or (<= 4294967295 .cse76) (not (<= 5000000 .cse76))))) is different from false [2022-03-18 12:50:27,542 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse1)) (<= 4294967295 .cse1))) (let ((.cse2 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ c_main_~x~0 75) 4294967296))) (or (not (<= 5000000 .cse3)) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ 17 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 63 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (<= 4294967295 .cse5))) (let ((.cse6 (mod (+ 14 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 51 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 52 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ c_main_~x~0 11) 4294967296))) (or (<= 4294967295 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ 7 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ 13 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse13)) (<= 4294967295 .cse13))) (let ((.cse14 (mod (+ 47 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ 72 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ 58 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse17)) (<= 4294967295 .cse17))) (let ((.cse18 (mod (+ 57 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse19)) (<= 4294967295 .cse19))) (let ((.cse20 (mod (+ 76 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse20)) (<= 4294967295 .cse20))) (let ((.cse21 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 3 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ 39 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ 65 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ 9 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ 67 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 50) 4294967296))) (or (<= 4294967295 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse28)) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ 74 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ 60 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse31)) (<= 4294967295 .cse31))) (let ((.cse32 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse32)) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ 53 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ c_main_~x~0 24) 4294967296))) (or (<= 4294967295 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ c_main_~x~0 1) 4294967296))) (or (not (<= 5000000 .cse35)) (<= 4294967295 .cse35))) (let ((.cse36 (mod (+ 16 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse37)) (<= 4294967295 .cse37))) (let ((.cse38 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse38)) (<= 4294967295 .cse38))) (let ((.cse39 (mod (+ 33 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse39) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ 6 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 21 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse41) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ 26 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse42) (not (<= 5000000 .cse42)))) (let ((.cse43 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse43)) (<= 4294967295 .cse43))) (let ((.cse44 (mod (+ c_main_~x~0 54) 4294967296))) (or (<= 4294967295 .cse44) (not (<= 5000000 .cse44)))) (let ((.cse45 (mod (+ 10 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse45) (not (<= 5000000 .cse45)))) (let ((.cse46 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (<= 4294967295 .cse46))) (let ((.cse47 (mod (+ c_main_~x~0 37) 4294967296))) (or (<= 4294967295 .cse47) (not (<= 5000000 .cse47)))) (let ((.cse48 (mod (+ 73 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse48) (not (<= 5000000 .cse48)))) (let ((.cse49 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse49)) (<= 4294967295 .cse49))) (let ((.cse50 (mod (+ 5 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse50)) (<= 4294967295 .cse50))) (let ((.cse51 (mod (+ 42 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse51) (not (<= 5000000 .cse51)))) (let ((.cse52 (mod (+ 4 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse52)) (<= 4294967295 .cse52))) (let ((.cse53 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse53)) (<= 4294967295 .cse53))) (let ((.cse54 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (<= 5000000 .cse54)) (<= 4294967295 .cse54))) (let ((.cse55 (mod (+ 48 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse55) (not (<= 5000000 .cse55)))) (let ((.cse56 (mod (+ 12 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse56)) (<= 4294967295 .cse56))) (let ((.cse57 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse57)) (<= 4294967295 .cse57))) (let ((.cse58 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse58)) (<= 4294967295 .cse58))) (let ((.cse59 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse59)) (<= 4294967295 .cse59))) (let ((.cse60 (mod (+ 62 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse60)) (<= 4294967295 .cse60))) (let ((.cse61 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse61)) (<= 4294967295 .cse61))) (let ((.cse62 (mod (+ 36 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse62) (not (<= 5000000 .cse62)))) (let ((.cse63 (mod (+ 22 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse63) (not (<= 5000000 .cse63)))) (not (<= 5000000 (mod c_main_~x~0 4294967296))) (let ((.cse64 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse64)) (<= 4294967295 .cse64))) (let ((.cse65 (mod (+ 70 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse65) (not (<= 5000000 .cse65)))) (let ((.cse66 (mod (+ 20 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse66) (not (<= 5000000 .cse66)))) (let ((.cse67 (mod (+ 29 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse67) (not (<= 5000000 .cse67)))) (let ((.cse68 (mod (+ 69 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse68) (not (<= 5000000 .cse68)))) (let ((.cse69 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse69)) (<= 4294967295 .cse69))) (let ((.cse70 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse70)) (<= 4294967295 .cse70))) (let ((.cse71 (mod (+ 8 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse71) (not (<= 5000000 .cse71)))) (let ((.cse72 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse72)) (<= 4294967295 .cse72))) (let ((.cse73 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse73)) (<= 4294967295 .cse73))) (let ((.cse74 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse74)) (<= 4294967295 .cse74))) (let ((.cse75 (mod (+ 15 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse75) (not (<= 5000000 .cse75)))) (let ((.cse76 (mod (+ c_main_~x~0 61) 4294967296))) (or (<= 4294967295 .cse76) (not (<= 5000000 .cse76))))) is different from false [2022-03-18 12:50:29,565 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse1)) (<= 4294967295 .cse1))) (let ((.cse2 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ c_main_~x~0 75) 4294967296))) (or (not (<= 5000000 .cse3)) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ 17 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 63 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (<= 4294967295 .cse5))) (let ((.cse6 (mod (+ 51 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 52 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse8)) (<= 4294967295 .cse8))) (let ((.cse9 (mod (+ 47 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ 72 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse11)) (<= 4294967295 .cse11))) (let ((.cse12 (mod (+ 58 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse12)) (<= 4294967295 .cse12))) (let ((.cse13 (mod (+ 57 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse14)) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ 76 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ 39 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 65 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 67 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ c_main_~x~0 50) 4294967296))) (or (<= 4294967295 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse22)) (<= 4294967295 .cse22))) (let ((.cse23 (mod (+ 74 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse23)) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 60 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse24)) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse25)) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ 53 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (<= 4294967295 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 16 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ 33 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ 21 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ 26 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse34)) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ c_main_~x~0 54) 4294967296))) (or (<= 4294967295 .cse35) (not (<= 5000000 .cse35)))) (let ((.cse36 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse36)) (<= 4294967295 .cse36))) (let ((.cse37 (mod (+ c_main_~x~0 37) 4294967296))) (or (<= 4294967295 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 73 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse38) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse39)) (<= 4294967295 .cse39))) (let ((.cse40 (mod (+ 42 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse41)) (<= 4294967295 .cse41))) (let ((.cse42 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (<= 5000000 .cse42)) (<= 4294967295 .cse42))) (let ((.cse43 (mod (+ 48 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse43) (not (<= 5000000 .cse43)))) (let ((.cse44 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse44)) (<= 4294967295 .cse44))) (let ((.cse45 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse45)) (<= 4294967295 .cse45))) (let ((.cse46 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (<= 4294967295 .cse46))) (let ((.cse47 (mod (+ 62 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse47)) (<= 4294967295 .cse47))) (let ((.cse48 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse48)) (<= 4294967295 .cse48))) (let ((.cse49 (mod (+ 36 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse49) (not (<= 5000000 .cse49)))) (let ((.cse50 (mod (+ 22 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse50) (not (<= 5000000 .cse50)))) (let ((.cse51 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse51)) (<= 4294967295 .cse51))) (let ((.cse52 (mod (+ 70 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse52) (not (<= 5000000 .cse52)))) (let ((.cse53 (mod (+ 20 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse53) (not (<= 5000000 .cse53)))) (let ((.cse54 (mod (+ 29 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse54) (not (<= 5000000 .cse54)))) (let ((.cse55 (mod (+ 69 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse55) (not (<= 5000000 .cse55)))) (let ((.cse56 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse56)) (<= 4294967295 .cse56))) (let ((.cse57 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse57)) (<= 4294967295 .cse57))) (let ((.cse58 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse58)) (<= 4294967295 .cse58))) (let ((.cse59 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse59)) (<= 4294967295 .cse59))) (let ((.cse60 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse60)) (<= 4294967295 .cse60))) (let ((.cse61 (mod (+ c_main_~x~0 61) 4294967296))) (or (<= 4294967295 .cse61) (not (<= 5000000 .cse61))))) is different from false [2022-03-18 12:54:09,494 WARN L232 SmtUtils]: Spent 1.09m on a formula simplification. DAG size of input: 439 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 12:54:11,536 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse1)) (<= 4294967295 .cse1))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse2 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ c_main_~x~0 75) 4294967296))) (or (not (<= 5000000 .cse3)) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ 17 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 63 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (<= 4294967295 .cse5))) (let ((.cse6 (mod (+ 51 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 52 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse8)) (<= 4294967295 .cse8))) (let ((.cse9 (mod (+ 47 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ 72 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse11)) (<= 4294967295 .cse11))) (let ((.cse12 (mod (+ 58 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse12)) (<= 4294967295 .cse12))) (let ((.cse13 (mod (+ 57 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse14)) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ 76 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ 39 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 65 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 67 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ c_main_~x~0 50) 4294967296))) (or (<= 4294967295 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse22)) (<= 4294967295 .cse22))) (let ((.cse23 (mod (+ 74 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse23)) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 60 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse24)) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse25)) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ 53 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (<= 4294967295 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 16 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ 33 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ 21 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ 26 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse34)) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ c_main_~x~0 54) 4294967296))) (or (<= 4294967295 .cse35) (not (<= 5000000 .cse35)))) (let ((.cse36 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse36)) (<= 4294967295 .cse36))) (let ((.cse37 (mod (+ c_main_~x~0 37) 4294967296))) (or (<= 4294967295 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 73 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse38) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse39)) (<= 4294967295 .cse39))) (let ((.cse40 (mod (+ 42 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse41)) (<= 4294967295 .cse41))) (let ((.cse42 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (<= 5000000 .cse42)) (<= 4294967295 .cse42))) (let ((.cse43 (mod (+ 48 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse43) (not (<= 5000000 .cse43)))) (let ((.cse44 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse44)) (<= 4294967295 .cse44))) (let ((.cse45 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse45)) (<= 4294967295 .cse45))) (let ((.cse46 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (<= 4294967295 .cse46))) (let ((.cse47 (mod (+ 62 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse47)) (<= 4294967295 .cse47))) (let ((.cse48 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse48)) (<= 4294967295 .cse48))) (let ((.cse49 (mod (+ 36 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse49) (not (<= 5000000 .cse49)))) (let ((.cse50 (mod (+ 22 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse50) (not (<= 5000000 .cse50)))) (let ((.cse51 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse51)) (<= 4294967295 .cse51))) (let ((.cse52 (mod (+ 70 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse52) (not (<= 5000000 .cse52)))) (let ((.cse53 (mod (+ 20 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse53) (not (<= 5000000 .cse53)))) (let ((.cse54 (mod (+ 29 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse54) (not (<= 5000000 .cse54)))) (let ((.cse55 (mod (+ 69 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse55) (not (<= 5000000 .cse55)))) (let ((.cse56 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse56)) (<= 4294967295 .cse56))) (let ((.cse57 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse57)) (<= 4294967295 .cse57))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse58 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse58)) (<= 4294967295 .cse58))) (let ((.cse59 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse59)) (<= 4294967295 .cse59))) (let ((.cse60 (mod (+ 15 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse60) (not (<= 5000000 .cse60)))) (let ((.cse61 (mod (+ c_main_~x~0 61) 4294967296))) (or (<= 4294967295 .cse61) (not (<= 5000000 .cse61))))) is different from false [2022-03-18 12:54:13,554 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse1)) (<= 4294967295 .cse1))) (let ((.cse2 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ c_main_~x~0 75) 4294967296))) (or (not (<= 5000000 .cse3)) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ 17 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 63 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (<= 4294967295 .cse5))) (let ((.cse6 (mod (+ 51 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 52 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse8)) (<= 4294967295 .cse8))) (let ((.cse9 (mod (+ 47 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ 72 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse11)) (<= 4294967295 .cse11))) (let ((.cse12 (mod (+ 58 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse12)) (<= 4294967295 .cse12))) (let ((.cse13 (mod (+ 57 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse14)) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ 76 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ 39 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 65 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 67 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ c_main_~x~0 50) 4294967296))) (or (<= 4294967295 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse22)) (<= 4294967295 .cse22))) (let ((.cse23 (mod (+ 74 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse23)) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 60 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse24)) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse25)) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ 53 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (<= 4294967295 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 16 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ 33 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ 21 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ 26 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse34)) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ c_main_~x~0 54) 4294967296))) (or (<= 4294967295 .cse35) (not (<= 5000000 .cse35)))) (let ((.cse36 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse36)) (<= 4294967295 .cse36))) (let ((.cse37 (mod (+ c_main_~x~0 37) 4294967296))) (or (<= 4294967295 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 73 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse38) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse39)) (<= 4294967295 .cse39))) (let ((.cse40 (mod (+ 42 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse41)) (<= 4294967295 .cse41))) (let ((.cse42 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (<= 5000000 .cse42)) (<= 4294967295 .cse42))) (let ((.cse43 (mod (+ 48 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse43) (not (<= 5000000 .cse43)))) (let ((.cse44 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse44)) (<= 4294967295 .cse44))) (let ((.cse45 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse45)) (<= 4294967295 .cse45))) (let ((.cse46 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (<= 4294967295 .cse46))) (let ((.cse47 (mod (+ 62 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse47)) (<= 4294967295 .cse47))) (let ((.cse48 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse48)) (<= 4294967295 .cse48))) (let ((.cse49 (mod (+ 36 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse49) (not (<= 5000000 .cse49)))) (let ((.cse50 (mod (+ 22 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse50) (not (<= 5000000 .cse50)))) (let ((.cse51 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse51)) (<= 4294967295 .cse51))) (let ((.cse52 (mod (+ 70 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse52) (not (<= 5000000 .cse52)))) (let ((.cse53 (mod (+ 20 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse53) (not (<= 5000000 .cse53)))) (let ((.cse54 (mod (+ 29 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse54) (not (<= 5000000 .cse54)))) (let ((.cse55 (mod (+ 69 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse55) (not (<= 5000000 .cse55)))) (let ((.cse56 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse56)) (<= 4294967295 .cse56))) (let ((.cse57 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse57)) (<= 4294967295 .cse57))) (let ((.cse58 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse58)) (<= 4294967295 .cse58))) (let ((.cse59 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse59)) (<= 4294967295 .cse59))) (let ((.cse60 (mod (+ c_main_~x~0 61) 4294967296))) (or (<= 4294967295 .cse60) (not (<= 5000000 .cse60))))) is different from false