/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono5_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-14 21:05:09,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-14 21:05:09,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-14 21:05:09,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-14 21:05:09,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-14 21:05:09,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-14 21:05:09,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-14 21:05:09,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-14 21:05:09,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-14 21:05:09,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-14 21:05:09,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-14 21:05:09,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-14 21:05:09,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-14 21:05:09,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-14 21:05:09,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-14 21:05:09,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-14 21:05:09,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-14 21:05:09,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-14 21:05:09,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-14 21:05:09,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-14 21:05:09,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-14 21:05:09,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-14 21:05:09,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-14 21:05:09,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-14 21:05:09,092 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-14 21:05:09,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-14 21:05:09,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-14 21:05:09,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-14 21:05:09,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-14 21:05:09,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-14 21:05:09,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-14 21:05:09,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-14 21:05:09,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-14 21:05:09,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-14 21:05:09,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-14 21:05:09,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-14 21:05:09,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-14 21:05:09,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-14 21:05:09,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-14 21:05:09,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-14 21:05:09,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-14 21:05:09,103 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-14 21:05:09,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-14 21:05:09,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-14 21:05:09,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-14 21:05:09,119 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-14 21:05:09,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-14 21:05:09,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-14 21:05:09,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-14 21:05:09,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-14 21:05:09,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-14 21:05:09,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-14 21:05:09,120 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-14 21:05:09,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-14 21:05:09,120 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-14 21:05:09,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-14 21:05:09,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-14 21:05:09,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-14 21:05:09,121 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-14 21:05:09,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-14 21:05:09,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:05:09,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-14 21:05:09,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-14 21:05:09,122 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-14 21:05:09,122 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-14 21:05:09,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-14 21:05:09,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-14 21:05:09,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-14 21:05:09,328 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-14 21:05:09,329 INFO L275 PluginConnector]: CDTParser initialized [2022-02-14 21:05:09,330 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono5_1.c [2022-02-14 21:05:09,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3aa6f56d/26dde2716c7d4be1ba4bb7cce8848edd/FLAGc6a4f0a10 [2022-02-14 21:05:09,685 INFO L306 CDTParser]: Found 1 translation units. [2022-02-14 21:05:09,686 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono5_1.c [2022-02-14 21:05:09,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3aa6f56d/26dde2716c7d4be1ba4bb7cce8848edd/FLAGc6a4f0a10 [2022-02-14 21:05:10,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3aa6f56d/26dde2716c7d4be1ba4bb7cce8848edd [2022-02-14 21:05:10,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-14 21:05:10,123 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-14 21:05:10,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-14 21:05:10,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-14 21:05:10,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-14 21:05:10,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:05:10" (1/1) ... [2022-02-14 21:05:10,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b6f931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:10, skipping insertion in model container [2022-02-14 21:05:10,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:05:10" (1/1) ... [2022-02-14 21:05:10,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-14 21:05:10,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-14 21:05:10,309 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/Mono5_1.c[311,324] [2022-02-14 21:05:10,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:05:10,337 INFO L203 MainTranslator]: Completed pre-run [2022-02-14 21:05:10,345 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/Mono5_1.c[311,324] [2022-02-14 21:05:10,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:05:10,356 INFO L208 MainTranslator]: Completed translation [2022-02-14 21:05:10,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:10 WrapperNode [2022-02-14 21:05:10,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-14 21:05:10,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-14 21:05:10,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-14 21:05:10,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-14 21:05:10,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:10" (1/1) ... [2022-02-14 21:05:10,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:10" (1/1) ... [2022-02-14 21:05:10,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:10" (1/1) ... [2022-02-14 21:05:10,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:10" (1/1) ... [2022-02-14 21:05:10,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:10" (1/1) ... [2022-02-14 21:05:10,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:10" (1/1) ... [2022-02-14 21:05:10,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:10" (1/1) ... [2022-02-14 21:05:10,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-14 21:05:10,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-14 21:05:10,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-14 21:05:10,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-14 21:05:10,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:10" (1/1) ... [2022-02-14 21:05:10,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:05:10,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:05:10,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-14 21:05:10,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-14 21:05:10,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-14 21:05:10,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-14 21:05:10,444 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-14 21:05:10,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-14 21:05:10,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-14 21:05:10,444 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-14 21:05:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-14 21:05:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-14 21:05:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-14 21:05:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-14 21:05:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-14 21:05:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-14 21:05:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-14 21:05:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-14 21:05:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-14 21:05:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-14 21:05:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-14 21:05:10,492 INFO L234 CfgBuilder]: Building ICFG [2022-02-14 21:05:10,493 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-14 21:05:10,559 INFO L275 CfgBuilder]: Performing block encoding [2022-02-14 21:05:10,564 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-14 21:05:10,564 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-14 21:05:10,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:05:10 BoogieIcfgContainer [2022-02-14 21:05:10,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-14 21:05:10,566 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-14 21:05:10,566 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-14 21:05:10,567 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-14 21:05:10,574 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:05:10" (1/1) ... [2022-02-14 21:05:10,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:05:10 BasicIcfg [2022-02-14 21:05:10,584 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-14 21:05:10,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-14 21:05:10,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-14 21:05:10,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-14 21:05:10,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 09:05:10" (1/4) ... [2022-02-14 21:05:10,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a92be1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:05:10, skipping insertion in model container [2022-02-14 21:05:10,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:05:10" (2/4) ... [2022-02-14 21:05:10,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a92be1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:05:10, skipping insertion in model container [2022-02-14 21:05:10,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:05:10" (3/4) ... [2022-02-14 21:05:10,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a92be1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 09:05:10, skipping insertion in model container [2022-02-14 21:05:10,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:05:10" (4/4) ... [2022-02-14 21:05:10,591 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono5_1.cJordan [2022-02-14 21:05:10,594 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-14 21:05:10,595 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-14 21:05:10,626 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-14 21:05:10,632 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-14 21:05:10,632 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-14 21:05:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 21:05:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-14 21:05:10,647 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:10,647 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:10,648 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:10,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:10,652 INFO L85 PathProgramCache]: Analyzing trace with hash -154368955, now seen corresponding path program 1 times [2022-02-14 21:05:10,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:10,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102493070] [2022-02-14 21:05:10,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:10,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:10,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:05:10,790 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:10,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102493070] [2022-02-14 21:05:10,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102493070] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:05:10,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:05:10,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-14 21:05:10,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530134795] [2022-02-14 21:05:10,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:05:10,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-14 21:05:10,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:10,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-14 21:05:10,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-14 21:05:10,834 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:05:10,885 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-14 21:05:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-14 21:05:10,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-14 21:05:10,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:05:10,899 INFO L225 Difference]: With dead ends: 20 [2022-02-14 21:05:10,899 INFO L226 Difference]: Without dead ends: 14 [2022-02-14 21:05:10,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-14 21:05:10,903 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:05:10,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:05:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-14 21:05:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-14 21:05:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-02-14 21:05:10,931 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-02-14 21:05:10,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:05:10,932 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-02-14 21:05:10,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-14 21:05:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-14 21:05:10,933 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:10,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:10,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-14 21:05:10,934 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:10,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:10,936 INFO L85 PathProgramCache]: Analyzing trace with hash -153445434, now seen corresponding path program 1 times [2022-02-14 21:05:10,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:10,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256096114] [2022-02-14 21:05:10,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:10,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:11,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:05:11,127 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:11,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256096114] [2022-02-14 21:05:11,128 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256096114] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:05:11,128 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:05:11,128 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 21:05:11,128 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354761913] [2022-02-14 21:05:11,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:05:11,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 21:05:11,129 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:11,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 21:05:11,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 21:05:11,130 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:05:11,221 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-14 21:05:11,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 21:05:11,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-14 21:05:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:05:11,223 INFO L225 Difference]: With dead ends: 20 [2022-02-14 21:05:11,223 INFO L226 Difference]: Without dead ends: 17 [2022-02-14 21:05:11,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-14 21:05:11,230 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:05:11,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 31 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:05:11,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-14 21:05:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-14 21:05:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-02-14 21:05:11,239 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-02-14 21:05:11,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:05:11,239 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-14 21:05:11,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-14 21:05:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-14 21:05:11,240 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:11,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:11,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-14 21:05:11,244 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:11,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:11,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1203653974, now seen corresponding path program 1 times [2022-02-14 21:05:11,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:11,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929912347] [2022-02-14 21:05:11,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:11,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:11,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:05:11,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:11,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929912347] [2022-02-14 21:05:11,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929912347] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:05:11,359 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:05:11,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-14 21:05:11,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421347695] [2022-02-14 21:05:11,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:05:11,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-14 21:05:11,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:11,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-14 21:05:11,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-14 21:05:11,361 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:11,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:05:11,394 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-14 21:05:11,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-14 21:05:11,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2022-02-14 21:05:11,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:05:11,396 INFO L225 Difference]: With dead ends: 20 [2022-02-14 21:05:11,396 INFO L226 Difference]: Without dead ends: 20 [2022-02-14 21:05:11,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-14 21:05:11,403 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:05:11,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:05:11,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-14 21:05:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-14 21:05:11,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-02-14 21:05:11,409 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2022-02-14 21:05:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:05:11,409 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-02-14 21:05:11,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-02-14 21:05:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 21:05:11,411 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:11,411 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:11,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-14 21:05:11,411 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:11,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1828446949, now seen corresponding path program 1 times [2022-02-14 21:05:11,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:11,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506614769] [2022-02-14 21:05:11,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:11,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:05:11,533 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:11,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506614769] [2022-02-14 21:05:11,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506614769] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:05:11,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041988940] [2022-02-14 21:05:11,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:11,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:11,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:05:11,539 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:05:11,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-14 21:05:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:11,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 21:05:11,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:05:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:05:11,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:05:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:05:11,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041988940] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:05:11,782 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:05:11,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-02-14 21:05:11,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398979972] [2022-02-14 21:05:11,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:05:11,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-14 21:05:11,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:11,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-14 21:05:11,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-14 21:05:11,786 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:05:12,007 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-02-14 21:05:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-14 21:05:12,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-14 21:05:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:05:12,009 INFO L225 Difference]: With dead ends: 37 [2022-02-14 21:05:12,009 INFO L226 Difference]: Without dead ends: 32 [2022-02-14 21:05:12,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-02-14 21:05:12,010 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:05:12,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 50 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 21:05:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-14 21:05:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-02-14 21:05:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-02-14 21:05:12,015 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 17 [2022-02-14 21:05:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:05:12,015 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-02-14 21:05:12,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-02-14 21:05:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-14 21:05:12,016 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:12,016 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:12,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-14 21:05:12,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:12,232 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:12,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:12,232 INFO L85 PathProgramCache]: Analyzing trace with hash -976700890, now seen corresponding path program 2 times [2022-02-14 21:05:12,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:12,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439377024] [2022-02-14 21:05:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:12,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:12,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-14 21:05:12,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:12,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439377024] [2022-02-14 21:05:12,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439377024] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:05:12,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625980320] [2022-02-14 21:05:12,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:05:12,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:12,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:05:12,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:05:12,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-14 21:05:12,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:05:12,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:05:12,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-14 21:05:12,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:05:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-14 21:05:12,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:05:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-14 21:05:12,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625980320] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:05:12,725 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:05:12,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 18 [2022-02-14 21:05:12,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772995442] [2022-02-14 21:05:12,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:05:12,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-14 21:05:12,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:12,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-14 21:05:12,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-02-14 21:05:12,727 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:13,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:05:13,323 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2022-02-14 21:05:13,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-14 21:05:13,327 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-02-14 21:05:13,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:05:13,327 INFO L225 Difference]: With dead ends: 61 [2022-02-14 21:05:13,327 INFO L226 Difference]: Without dead ends: 53 [2022-02-14 21:05:13,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2022-02-14 21:05:13,329 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 121 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:05:13,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 79 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-14 21:05:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-14 21:05:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-02-14 21:05:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-02-14 21:05:13,334 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 29 [2022-02-14 21:05:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:05:13,334 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-02-14 21:05:13,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-02-14 21:05:13,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-14 21:05:13,336 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:13,336 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:13,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-14 21:05:13,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:13,555 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:13,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:13,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1868071817, now seen corresponding path program 3 times [2022-02-14 21:05:13,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:13,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665834083] [2022-02-14 21:05:13,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:13,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:13,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 106 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-02-14 21:05:13,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:13,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665834083] [2022-02-14 21:05:13,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665834083] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:05:13,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736980102] [2022-02-14 21:05:13,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-14 21:05:13,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:13,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:05:13,724 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:05:13,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-14 21:05:13,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-02-14 21:05:13,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:05:13,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-14 21:05:13,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:05:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 106 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-02-14 21:05:14,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:05:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 106 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-02-14 21:05:14,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736980102] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:05:14,218 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:05:14,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-02-14 21:05:14,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125771104] [2022-02-14 21:05:14,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:05:14,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-14 21:05:14,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:14,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-14 21:05:14,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-02-14 21:05:14,220 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 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-02-14 21:05:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:05:14,997 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-02-14 21:05:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-14 21:05:14,997 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 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 50 [2022-02-14 21:05:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:05:14,998 INFO L225 Difference]: With dead ends: 77 [2022-02-14 21:05:14,998 INFO L226 Difference]: Without dead ends: 77 [2022-02-14 21:05:14,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2022-02-14 21:05:14,999 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 54 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:05:14,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 39 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 21:05:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-14 21:05:15,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2022-02-14 21:05:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-02-14 21:05:15,005 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 50 [2022-02-14 21:05:15,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:05:15,005 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-02-14 21:05:15,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 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-02-14 21:05:15,005 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-02-14 21:05:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-14 21:05:15,006 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:15,006 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:15,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-14 21:05:15,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:15,217 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:15,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:15,217 INFO L85 PathProgramCache]: Analyzing trace with hash -31358138, now seen corresponding path program 4 times [2022-02-14 21:05:15,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:15,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409161614] [2022-02-14 21:05:15,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:15,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:15,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 251 proven. 100 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-02-14 21:05:15,436 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:15,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409161614] [2022-02-14 21:05:15,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409161614] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:05:15,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927924510] [2022-02-14 21:05:15,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-14 21:05:15,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:15,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:05:15,438 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:05:15,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-14 21:05:15,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-14 21:05:15,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:05:15,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-14 21:05:15,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:05:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 377 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-02-14 21:05:15,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:05:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 377 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-02-14 21:05:16,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927924510] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:05:16,311 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:05:16,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 36 [2022-02-14 21:05:16,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208320868] [2022-02-14 21:05:16,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:05:16,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-14 21:05:16,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:16,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-14 21:05:16,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2022-02-14 21:05:16,316 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:05:24,784 INFO L93 Difference]: Finished difference Result 121 states and 155 transitions. [2022-02-14 21:05:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-14 21:05:24,785 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-02-14 21:05:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:05:24,786 INFO L225 Difference]: With dead ends: 121 [2022-02-14 21:05:24,786 INFO L226 Difference]: Without dead ends: 107 [2022-02-14 21:05:24,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=916, Invalid=3776, Unknown=0, NotChecked=0, Total=4692 [2022-02-14 21:05:24,788 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 436 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:05:24,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 157 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-14 21:05:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-14 21:05:24,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2022-02-14 21:05:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 101 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2022-02-14 21:05:24,796 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 65 [2022-02-14 21:05:24,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:05:24,796 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2022-02-14 21:05:24,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:05:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2022-02-14 21:05:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-14 21:05:24,799 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:05:24,799 INFO L514 BasicCegarLoop]: trace histogram [31, 31, 22, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:05:24,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-14 21:05:25,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:25,016 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:05:25,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:05:25,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1862805289, now seen corresponding path program 5 times [2022-02-14 21:05:25,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:05:25,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148533211] [2022-02-14 21:05:25,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:05:25,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:05:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:25,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:05:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:05:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 628 proven. 126 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2022-02-14 21:05:25,253 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:05:25,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148533211] [2022-02-14 21:05:25,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148533211] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:05:25,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958614745] [2022-02-14 21:05:25,253 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-14 21:05:25,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:05:25,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:05:25,255 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:05:25,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-14 21:05:37,990 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2022-02-14 21:05:37,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:05:37,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 50 conjunts are in the unsatisfiable core [2022-02-14 21:05:37,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:05:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-02-14 21:05:38,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:05:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-02-14 21:05:39,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958614745] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:05:39,794 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:05:39,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 27, 27] total 61 [2022-02-14 21:05:39,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264800957] [2022-02-14 21:05:39,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:05:39,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-02-14 21:05:39,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:05:39,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-02-14 21:05:39,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=3003, Unknown=0, NotChecked=0, Total=3660 [2022-02-14 21:05:39,797 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand has 61 states, 61 states have (on average 2.9836065573770494) internal successors, (182), 59 states have internal predecessors, (182), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:06:48,157 WARN L228 SmtUtils]: Spent 38.41s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:07:43,363 WARN L228 SmtUtils]: Spent 33.09s on a formula simplification that was a NOOP. DAG size: 118 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:08:32,787 WARN L228 SmtUtils]: Spent 24.41s on a formula simplification that was a NOOP. DAG size: 113 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:09:24,300 WARN L228 SmtUtils]: Spent 28.50s on a formula simplification that was a NOOP. DAG size: 108 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:10:00,755 WARN L228 SmtUtils]: Spent 18.97s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:10:25,578 WARN L228 SmtUtils]: Spent 11.64s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:10:52,542 WARN L228 SmtUtils]: Spent 16.40s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:11:10,781 WARN L228 SmtUtils]: Spent 7.04s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:11:24,321 WARN L228 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:11:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:11:59,025 INFO L93 Difference]: Finished difference Result 208 states and 278 transitions. [2022-02-14 21:11:59,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-02-14 21:11:59,025 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.9836065573770494) internal successors, (182), 59 states have internal predecessors, (182), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-02-14 21:11:59,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:11:59,026 INFO L225 Difference]: With dead ends: 208 [2022-02-14 21:11:59,026 INFO L226 Difference]: Without dead ends: 182 [2022-02-14 21:11:59,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 374.2s TimeCoverageRelationStatistics Valid=2953, Invalid=11080, Unknown=9, NotChecked=0, Total=14042 [2022-02-14 21:11:59,030 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 1331 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3427 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 3563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 3427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-02-14 21:11:59,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1331 Valid, 213 Invalid, 3563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 3427 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-02-14 21:11:59,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-14 21:11:59,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2022-02-14 21:11:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.2727272727272727) internal successors, (224), 176 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:11:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 228 transitions. [2022-02-14 21:11:59,040 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 228 transitions. Word has length 104 [2022-02-14 21:11:59,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:11:59,040 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 228 transitions. [2022-02-14 21:11:59,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.9836065573770494) internal successors, (182), 59 states have internal predecessors, (182), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:11:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 228 transitions. [2022-02-14 21:11:59,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-02-14 21:11:59,042 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:11:59,042 INFO L514 BasicCegarLoop]: trace histogram [56, 56, 46, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:11:59,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-14 21:11:59,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:11:59,249 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:11:59,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:11:59,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1126581850, now seen corresponding path program 6 times [2022-02-14 21:11:59,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:11:59,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116742925] [2022-02-14 21:11:59,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:11:59,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:11:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:11:59,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:11:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:11:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1461 proven. 155 refuted. 0 times theorem prover too weak. 3060 trivial. 0 not checked. [2022-02-14 21:11:59,533 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:11:59,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116742925] [2022-02-14 21:11:59,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116742925] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:11:59,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210946550] [2022-02-14 21:11:59,533 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-14 21:11:59,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:11:59,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:11:59,535 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:11:59,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-14 21:12:51,109 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2022-02-14 21:12:51,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:12:51,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-14 21:12:51,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:12:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 2049 proven. 442 refuted. 0 times theorem prover too weak. 2185 trivial. 0 not checked. [2022-02-14 21:12:51,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:12:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 2049 proven. 442 refuted. 0 times theorem prover too weak. 2185 trivial. 0 not checked. [2022-02-14 21:12:52,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210946550] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:12:52,605 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:12:52,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 20] total 40 [2022-02-14 21:12:52,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643685653] [2022-02-14 21:12:52,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:12:52,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-14 21:12:52,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:12:52,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-14 21:12:52,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=1130, Unknown=0, NotChecked=0, Total=1560 [2022-02-14 21:12:52,608 INFO L87 Difference]: Start difference. First operand 181 states and 228 transitions. Second operand has 40 states, 40 states have (on average 3.025) internal successors, (121), 39 states have internal predecessors, (121), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:13:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:13:30,758 INFO L93 Difference]: Finished difference Result 305 states and 352 transitions. [2022-02-14 21:13:30,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-02-14 21:13:30,759 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.025) internal successors, (121), 39 states have internal predecessors, (121), 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 179 [2022-02-14 21:13:30,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:13:30,761 INFO L225 Difference]: With dead ends: 305 [2022-02-14 21:13:30,761 INFO L226 Difference]: Without dead ends: 305 [2022-02-14 21:13:30,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 334 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 38.5s TimeCoverageRelationStatistics Valid=1538, Invalid=4161, Unknown=1, NotChecked=0, Total=5700 [2022-02-14 21:13:30,763 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 239 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-14 21:13:30,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 119 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-14 21:13:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-02-14 21:13:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 259. [2022-02-14 21:13:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 254 states have (on average 1.188976377952756) internal successors, (302), 254 states have internal predecessors, (302), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:13:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 306 transitions. [2022-02-14 21:13:30,774 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 306 transitions. Word has length 179 [2022-02-14 21:13:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:13:30,775 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 306 transitions. [2022-02-14 21:13:30,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.025) internal successors, (121), 39 states have internal predecessors, (121), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:13:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 306 transitions. [2022-02-14 21:13:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-02-14 21:13:30,778 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:13:30,778 INFO L514 BasicCegarLoop]: trace histogram [82, 82, 46, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:13:30,789 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-02-14 21:13:30,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:13:30,987 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:13:30,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:13:30,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1484851334, now seen corresponding path program 7 times [2022-02-14 21:13:30,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:13:30,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304355154] [2022-02-14 21:13:30,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:13:30,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:13:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:13:31,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:13:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:13:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 5023 proven. 1962 refuted. 0 times theorem prover too weak. 3060 trivial. 0 not checked. [2022-02-14 21:13:31,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:13:31,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304355154] [2022-02-14 21:13:31,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304355154] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:13:31,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938600040] [2022-02-14 21:13:31,935 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-14 21:13:31,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:13:31,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:13:31,936 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-02-14 21:13:31,937 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-02-14 21:13:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:13:32,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 97 conjunts are in the unsatisfiable core [2022-02-14 21:13:32,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:13:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 0 proven. 8083 refuted. 0 times theorem prover too weak. 1962 trivial. 0 not checked. [2022-02-14 21:13:34,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:13:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 0 proven. 8083 refuted. 0 times theorem prover too weak. 1962 trivial. 0 not checked. [2022-02-14 21:13:39,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938600040] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:13:39,120 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:13:39,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 51, 51] total 136 [2022-02-14 21:13:39,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833865835] [2022-02-14 21:13:39,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:13:39,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-02-14 21:13:39,121 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:13:39,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-02-14 21:13:39,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2514, Invalid=15846, Unknown=0, NotChecked=0, Total=18360 [2022-02-14 21:13:39,126 INFO L87 Difference]: Start difference. First operand 259 states and 306 transitions. Second operand has 136 states, 136 states have (on average 2.9926470588235294) internal successors, (407), 134 states have internal predecessors, (407), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:13:50,997 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 4294967253 c_main_~z~0) 4294967296) 0)) (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 4294967267 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967271 c_main_~z~0) 4294967296) 0)) (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967276 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967252 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967258 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967263 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967251 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967275 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967256 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967260 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967264 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967270 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967262 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~z~0) 4294967296) 0)) (not (= (mod c_main_~z~0 4294967296) 0)) (not (= (mod (+ 4294967282 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967259 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967269 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967279 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967285 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967268 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967254 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967278 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967283 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967281 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967266 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967272 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967273 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967255) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967257) 4294967296) 0)) (not (= (mod (+ 4294967274 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967250 c_main_~z~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (not (= (mod (+ 4294967261 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967265 c_main_~z~0) 4294967296) 0))) is different from false [2022-02-14 21:13:53,119 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 4294967253 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967267 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967271 c_main_~z~0) 4294967296) 0)) (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967276 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967252 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967258 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967263 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967251 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967275 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967256 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967260 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967264 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967270 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967262 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~z~0) 4294967296) 0)) (not (= (mod c_main_~z~0 4294967296) 0)) (not (= (mod (+ 4294967282 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967259 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967269 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967279 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967285 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967268 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967254 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967278 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967283 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967281 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967266 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967272 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967273 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967255) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967257) 4294967296) 0)) (not (= (mod (+ 4294967274 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967250 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967261 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967265 c_main_~z~0) 4294967296) 0))) is different from false [2022-02-14 21:13:55,128 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 4294967253 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967267 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967271 c_main_~z~0) 4294967296) 0)) (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967276 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967252 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967258 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967263 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967251 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967275 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967256 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967260 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967264 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967270 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967262 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967282 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967259 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967269 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967279 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967285 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967268 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967254 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967278 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967283 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967281 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967266 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967272 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967273 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967255) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967257) 4294967296) 0)) (not (= (mod (+ 4294967274 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967250 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967261 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967265 c_main_~z~0) 4294967296) 0))) is different from false [2022-02-14 21:13:57,142 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 4294967253 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967267 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967271 c_main_~z~0) 4294967296) 0)) (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967276 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967252 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967258 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967263 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967251 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967275 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967256 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967260 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967264 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967270 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967262 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~z~0) 4294967296) 0)) (not (= (mod c_main_~z~0 4294967296) 0)) (not (= (mod (+ 4294967282 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967259 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967269 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967279 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967285 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967268 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967254 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967278 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967283 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967281 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967266 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967272 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967273 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967255) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967257) 4294967296) 0)) (not (= (mod (+ 4294967274 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967261 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967265 c_main_~z~0) 4294967296) 0))) is different from false [2022-02-14 21:13:59,295 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 4294967253 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967267 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967271 c_main_~z~0) 4294967296) 0)) (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967276 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967252 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967258 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967263 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967251 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967275 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967256 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967260 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967264 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967270 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967262 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967282 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967259 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967269 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967279 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967285 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967268 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967254 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967278 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967283 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967281 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967266 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967272 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967273 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967255) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967257) 4294967296) 0)) (not (= (mod (+ 4294967274 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967261 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967265 c_main_~z~0) 4294967296) 0))) is different from false [2022-02-14 21:14:01,367 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 4294967253 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967267 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967271 c_main_~z~0) 4294967296) 0)) (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967276 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967252 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967258 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967263 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967275 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967256 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967260 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967264 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967270 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967262 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~z~0) 4294967296) 0)) (not (= (mod c_main_~z~0 4294967296) 0)) (not (= (mod (+ 4294967282 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967259 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967269 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967279 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967285 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967268 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967254 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967278 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967283 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967281 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967266 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967272 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967273 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967255) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967257) 4294967296) 0)) (not (= (mod (+ 4294967274 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967261 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967265 c_main_~z~0) 4294967296) 0))) is different from false [2022-02-14 21:14:03,576 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 4294967253 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967267 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967271 c_main_~z~0) 4294967296) 0)) (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967276 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967252 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967258 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967263 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967275 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967256 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967260 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967264 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967270 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967262 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967282 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967259 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967269 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967279 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967285 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967268 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967254 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967278 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967283 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967281 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967266 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967272 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967273 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967255) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967257) 4294967296) 0)) (not (= (mod (+ 4294967274 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967261 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967265 c_main_~z~0) 4294967296) 0))) is different from false [2022-02-14 21:18:37,981 WARN L228 SmtUtils]: Spent 2.29m on a formula simplification that was a NOOP. DAG size: 222 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:18:40,153 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-14 21:18:42,173 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 4294967253 c_main_~z~0) 4294967296) 0)) (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 4294967267 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967271 c_main_~z~0) 4294967296) 0)) (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967276 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967258 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967263 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967275 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967256 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967260 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967264 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967270 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967262 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~z~0) 4294967296) 0)) (not (= (mod c_main_~z~0 4294967296) 0)) (not (= (mod (+ 4294967282 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967259 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967269 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967279 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967285 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967268 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967254 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967278 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967283 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967281 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967266 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967272 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967273 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967255) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967257) 4294967296) 0)) (not (= (mod (+ 4294967274 c_main_~z~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (not (= (mod (+ 4294967261 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967265 c_main_~z~0) 4294967296) 0))) is different from false [2022-02-14 21:18:44,204 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 4294967253 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967267 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967271 c_main_~z~0) 4294967296) 0)) (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967276 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967258 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967263 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967275 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967256 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967260 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967264 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967270 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967262 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967282 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967259 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967269 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967279 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967285 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967268 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967254 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967278 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967283 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967281 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967266 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967272 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967273 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967255) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967257) 4294967296) 0)) (not (= (mod (+ 4294967274 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967261 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967265 c_main_~z~0) 4294967296) 0))) is different from false [2022-02-14 21:18:46,265 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 4294967267 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967271 c_main_~z~0) 4294967296) 0)) (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967276 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967258 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967263 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967275 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967256 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967260 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967264 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967270 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967262 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~z~0) 4294967296) 0)) (not (= (mod c_main_~z~0 4294967296) 0)) (not (= (mod (+ 4294967282 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967259 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967269 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967279 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967285 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967268 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967254 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967278 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967283 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967281 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967266 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967272 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967273 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967255) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967257) 4294967296) 0)) (not (= (mod (+ 4294967274 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967261 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967265 c_main_~z~0) 4294967296) 0))) is different from false [2022-02-14 21:18:50,419 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 4294967267 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967271 c_main_~z~0) 4294967296) 0)) (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967276 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967258 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967263 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967275 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967256 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967260 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967264 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967270 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967262 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~z~0) 4294967296) 0)) (not (= (mod c_main_~z~0 4294967296) 0)) (not (= (mod (+ 4294967282 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967259 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967269 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967279 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967285 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967268 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967254 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967278 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967283 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967281 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967266 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967272 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967273 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967255) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967257) 4294967296) 0)) (not (= (mod (+ 4294967274 c_main_~z~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (not (= (mod (+ 4294967261 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967265 c_main_~z~0) 4294967296) 0))) is different from false [2022-02-14 21:18:52,452 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 4294967267 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967271 c_main_~z~0) 4294967296) 0)) (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967276 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967258 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967263 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967275 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967256 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967260 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967264 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967270 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967262 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967282 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967259 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967269 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967279 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967285 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967268 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967254 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967278 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967283 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967281 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967266 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967272 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967273 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967255) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967257) 4294967296) 0)) (not (= (mod (+ 4294967274 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967261 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967265 c_main_~z~0) 4294967296) 0))) is different from false