/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-d966a43 [2022-01-31 12:45:55,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 12:45:55,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 12:45:55,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 12:45:55,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 12:45:55,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 12:45:55,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 12:45:55,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 12:45:55,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 12:45:55,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 12:45:55,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 12:45:55,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 12:45:55,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 12:45:55,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 12:45:55,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 12:45:55,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 12:45:55,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 12:45:55,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 12:45:55,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 12:45:55,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 12:45:55,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 12:45:55,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 12:45:55,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 12:45:55,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 12:45:55,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 12:45:55,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 12:45:55,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 12:45:55,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 12:45:55,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 12:45:55,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 12:45:55,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 12:45:55,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 12:45:55,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 12:45:55,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 12:45:55,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 12:45:55,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 12:45:55,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 12:45:55,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 12:45:55,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 12:45:55,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 12:45:55,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 12:45:55,383 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 12:45:55,391 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 12:45:55,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 12:45:55,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 12:45:55,393 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 12:45:55,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 12:45:55,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 12:45:55,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 12:45:55,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 12:45:55,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 12:45:55,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 12:45:55,393 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 12:45:55,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 12:45:55,393 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 12:45:55,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 12:45:55,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 12:45:55,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 12:45:55,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 12:45:55,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 12:45:55,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:45:55,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 12:45:55,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 12:45:55,395 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 12:45:55,395 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-01-31 12:45:55,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 12:45:55,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 12:45:55,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 12:45:55,563 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 12:45:55,566 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 12:45:55,567 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-01-31 12:45:55,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ac4915f1/786762dddac34136ba768c68512c6902/FLAG4e2b9a0d7 [2022-01-31 12:45:55,996 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 12:45:55,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono5_1.c [2022-01-31 12:45:56,004 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ac4915f1/786762dddac34136ba768c68512c6902/FLAG4e2b9a0d7 [2022-01-31 12:45:56,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ac4915f1/786762dddac34136ba768c68512c6902 [2022-01-31 12:45:56,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 12:45:56,028 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 12:45:56,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 12:45:56,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 12:45:56,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 12:45:56,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:45:56" (1/1) ... [2022-01-31 12:45:56,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33beb901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:45:56, skipping insertion in model container [2022-01-31 12:45:56,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:45:56" (1/1) ... [2022-01-31 12:45:56,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 12:45:56,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 12:45:56,190 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-01-31 12:45:56,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:45:56,222 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 12:45:56,231 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-01-31 12:45:56,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:45:56,242 INFO L208 MainTranslator]: Completed translation [2022-01-31 12:45:56,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:45:56 WrapperNode [2022-01-31 12:45:56,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 12:45:56,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 12:45:56,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 12:45:56,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 12:45:56,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:45:56" (1/1) ... [2022-01-31 12:45:56,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:45:56" (1/1) ... [2022-01-31 12:45:56,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:45:56" (1/1) ... [2022-01-31 12:45:56,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:45:56" (1/1) ... [2022-01-31 12:45:56,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:45:56" (1/1) ... [2022-01-31 12:45:56,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:45:56" (1/1) ... [2022-01-31 12:45:56,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:45:56" (1/1) ... [2022-01-31 12:45:56,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 12:45:56,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 12:45:56,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 12:45:56,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 12:45:56,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:45:56" (1/1) ... [2022-01-31 12:45:56,276 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:45:56,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:45:56,296 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-01-31 12:45:56,303 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-01-31 12:45:56,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 12:45:56,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 12:45:56,325 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 12:45:56,325 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 12:45:56,325 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 12:45:56,325 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 12:45:56,325 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 12:45:56,325 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 12:45:56,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 12:45:56,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 12:45:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 12:45:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 12:45:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 12:45:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 12:45:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 12:45:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 12:45:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 12:45:56,366 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 12:45:56,367 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 12:45:56,450 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 12:45:56,454 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 12:45:56,454 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 12:45:56,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:45:56 BoogieIcfgContainer [2022-01-31 12:45:56,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 12:45:56,456 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 12:45:56,456 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 12:45:56,457 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 12:45:56,459 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:45:56" (1/1) ... [2022-01-31 12:45:56,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:45:56 BasicIcfg [2022-01-31 12:45:56,483 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 12:45:56,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 12:45:56,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 12:45:56,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 12:45:56,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 12:45:56" (1/4) ... [2022-01-31 12:45:56,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fea0f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:45:56, skipping insertion in model container [2022-01-31 12:45:56,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:45:56" (2/4) ... [2022-01-31 12:45:56,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fea0f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:45:56, skipping insertion in model container [2022-01-31 12:45:56,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:45:56" (3/4) ... [2022-01-31 12:45:56,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fea0f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 12:45:56, skipping insertion in model container [2022-01-31 12:45:56,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:45:56" (4/4) ... [2022-01-31 12:45:56,500 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono5_1.cJordan [2022-01-31 12:45:56,503 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 12:45:56,503 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 12:45:56,536 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 12:45:56,540 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-01-31 12:45:56,541 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 12:45:56,549 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-01-31 12:45:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-31 12:45:56,554 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:45:56,554 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:45:56,555 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:45:56,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:45:56,558 INFO L85 PathProgramCache]: Analyzing trace with hash -154368955, now seen corresponding path program 1 times [2022-01-31 12:45:56,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:45:56,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139777619] [2022-01-31 12:45:56,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:45:56,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:45:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:45:56,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:45:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:45:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:45:56,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:45:56,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139777619] [2022-01-31 12:45:56,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139777619] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:45:56,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:45:56,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 12:45:56,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878849789] [2022-01-31 12:45:56,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:45:56,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 12:45:56,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:45:56,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 12:45:56,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 12:45:56,703 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-01-31 12:45:56,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:45:56,727 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-01-31 12:45:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 12:45:56,729 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-01-31 12:45:56,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:45:56,734 INFO L225 Difference]: With dead ends: 20 [2022-01-31 12:45:56,734 INFO L226 Difference]: Without dead ends: 14 [2022-01-31 12:45:56,736 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-01-31 12:45:56,738 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-01-31 12:45:56,739 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-01-31 12:45:56,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-01-31 12:45:56,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-01-31 12:45:56,762 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-01-31 12:45:56,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-01-31 12:45:56,764 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-01-31 12:45:56,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:45:56,764 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-01-31 12:45:56,764 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-01-31 12:45:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-01-31 12:45:56,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-31 12:45:56,765 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:45:56,765 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:45:56,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 12:45:56,766 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:45:56,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:45:56,773 INFO L85 PathProgramCache]: Analyzing trace with hash -153445434, now seen corresponding path program 1 times [2022-01-31 12:45:56,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:45:56,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356451973] [2022-01-31 12:45:56,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:45:56,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:45:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:45:56,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:45:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:45:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:45:56,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:45:56,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356451973] [2022-01-31 12:45:56,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356451973] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:45:56,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:45:56,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 12:45:56,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376051459] [2022-01-31 12:45:56,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:45:56,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 12:45:56,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:45:56,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 12:45:56,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 12:45:56,930 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-01-31 12:45:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:45:57,002 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-01-31 12:45:57,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 12:45:57,003 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-01-31 12:45:57,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:45:57,004 INFO L225 Difference]: With dead ends: 20 [2022-01-31 12:45:57,004 INFO L226 Difference]: Without dead ends: 17 [2022-01-31 12:45:57,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 12:45:57,011 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-01-31 12:45:57,011 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-01-31 12:45:57,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-31 12:45:57,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-31 12:45:57,014 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-01-31 12:45:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-01-31 12:45:57,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-01-31 12:45:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:45:57,015 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-01-31 12:45:57,015 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-01-31 12:45:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-01-31 12:45:57,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-31 12:45:57,017 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:45:57,018 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:45:57,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 12:45:57,020 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:45:57,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:45:57,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1203653974, now seen corresponding path program 1 times [2022-01-31 12:45:57,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:45:57,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494204941] [2022-01-31 12:45:57,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:45:57,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:45:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:45:57,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:45:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:45:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:45:57,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:45:57,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494204941] [2022-01-31 12:45:57,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494204941] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:45:57,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:45:57,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 12:45:57,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392815919] [2022-01-31 12:45:57,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:45:57,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 12:45:57,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:45:57,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 12:45:57,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 12:45:57,118 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-01-31 12:45:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:45:57,156 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-01-31 12:45:57,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 12:45:57,157 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-01-31 12:45:57,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:45:57,157 INFO L225 Difference]: With dead ends: 20 [2022-01-31 12:45:57,157 INFO L226 Difference]: Without dead ends: 20 [2022-01-31 12:45:57,158 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-01-31 12:45:57,158 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-01-31 12:45:57,159 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-01-31 12:45:57,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-31 12:45:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-01-31 12:45:57,161 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-01-31 12:45:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-01-31 12:45:57,162 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2022-01-31 12:45:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:45:57,162 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-01-31 12:45:57,162 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-01-31 12:45:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-01-31 12:45:57,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:45:57,163 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:45:57,163 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:45:57,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 12:45:57,163 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:45:57,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:45:57,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1828446949, now seen corresponding path program 1 times [2022-01-31 12:45:57,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:45:57,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71130340] [2022-01-31 12:45:57,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:45:57,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:45:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:45:57,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:45:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:45:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:45:57,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:45:57,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71130340] [2022-01-31 12:45:57,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71130340] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:45:57,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509627972] [2022-01-31 12:45:57,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:45:57,267 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:45:57,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:45:57,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:45:57,282 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-01-31 12:45:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:45:57,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:45:57,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:45:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:45:57,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:45:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:45:57,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509627972] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:45:57,493 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:45:57,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-01-31 12:45:57,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466736578] [2022-01-31 12:45:57,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:45:57,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 12:45:57,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:45:57,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 12:45:57,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-01-31 12:45:57,494 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-01-31 12:45:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:45:57,637 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-01-31 12:45:57,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 12:45:57,638 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-01-31 12:45:57,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:45:57,638 INFO L225 Difference]: With dead ends: 37 [2022-01-31 12:45:57,638 INFO L226 Difference]: Without dead ends: 32 [2022-01-31 12:45:57,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-01-31 12:45:57,640 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-01-31 12:45:57,640 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-01-31 12:45:57,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-31 12:45:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-01-31 12:45:57,643 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-01-31 12:45:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-01-31 12:45:57,643 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 17 [2022-01-31 12:45:57,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:45:57,643 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-01-31 12:45:57,644 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-01-31 12:45:57,644 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-01-31 12:45:57,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 12:45:57,644 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:45:57,644 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:45:57,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-31 12:45:57,873 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-01-31 12:45:57,873 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:45:57,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:45:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash -976700890, now seen corresponding path program 2 times [2022-01-31 12:45:57,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:45:57,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862742697] [2022-01-31 12:45:57,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:45:57,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:45:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:45:57,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:45:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:45:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 12:45:58,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:45:58,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862742697] [2022-01-31 12:45:58,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862742697] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:45:58,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403827370] [2022-01-31 12:45:58,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 12:45:58,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:45:58,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:45:58,004 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-01-31 12:45:58,005 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-01-31 12:45:58,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 12:45:58,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:45:58,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 12:45:58,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:45:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-31 12:45:58,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:45:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-31 12:45:58,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403827370] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:45:58,333 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:45:58,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 18 [2022-01-31 12:45:58,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316645979] [2022-01-31 12:45:58,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:45:58,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 12:45:58,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:45:58,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 12:45:58,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-01-31 12:45:58,337 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-01-31 12:45:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:45:58,863 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2022-01-31 12:45:58,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 12:45:58,863 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-01-31 12:45:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:45:58,864 INFO L225 Difference]: With dead ends: 61 [2022-01-31 12:45:58,864 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 12:45:58,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 12:45:58,865 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 121 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-01-31 12:45:58,865 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-01-31 12:45:58,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 12:45:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-01-31 12:45:58,869 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-01-31 12:45:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-01-31 12:45:58,870 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 29 [2022-01-31 12:45:58,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:45:58,870 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-01-31 12:45:58,870 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-01-31 12:45:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-01-31 12:45:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 12:45:58,871 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:45:58,871 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:45:58,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-31 12:45:59,087 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-01-31 12:45:59,087 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:45:59,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:45:59,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1868071817, now seen corresponding path program 3 times [2022-01-31 12:45:59,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:45:59,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238634390] [2022-01-31 12:45:59,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:45:59,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:45:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:45:59,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:45:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:45:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 106 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-01-31 12:45:59,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:45:59,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238634390] [2022-01-31 12:45:59,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238634390] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:45:59,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338100045] [2022-01-31 12:45:59,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 12:45:59,226 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:45:59,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:45:59,228 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-01-31 12:45:59,234 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-01-31 12:45:59,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-01-31 12:45:59,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:45:59,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 12:45:59,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:45:59,476 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 106 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-01-31 12:45:59,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:45:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 106 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-01-31 12:45:59,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338100045] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:45:59,641 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:45:59,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-01-31 12:45:59,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256441923] [2022-01-31 12:45:59,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:45:59,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 12:45:59,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:45:59,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 12:45:59,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-01-31 12:45:59,643 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-01-31 12:46:00,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:46:00,314 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-01-31 12:46:00,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 12:46:00,315 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-01-31 12:46:00,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:46:00,315 INFO L225 Difference]: With dead ends: 77 [2022-01-31 12:46:00,315 INFO L226 Difference]: Without dead ends: 77 [2022-01-31 12:46:00,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2022-01-31 12:46:00,316 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-01-31 12:46:00,317 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-01-31 12:46:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-31 12:46:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2022-01-31 12:46:00,320 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-01-31 12:46:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-01-31 12:46:00,321 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 50 [2022-01-31 12:46:00,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:46:00,321 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-01-31 12:46:00,322 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-01-31 12:46:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-01-31 12:46:00,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 12:46:00,323 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:46:00,323 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:46:00,329 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-01-31 12:46:00,527 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-01-31 12:46:00,527 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:46:00,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:46:00,527 INFO L85 PathProgramCache]: Analyzing trace with hash -31358138, now seen corresponding path program 4 times [2022-01-31 12:46:00,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:46:00,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156108002] [2022-01-31 12:46:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:46:00,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:46:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:46:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:46:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:46:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 251 proven. 100 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-01-31 12:46:00,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:46:00,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156108002] [2022-01-31 12:46:00,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156108002] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:46:00,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689484163] [2022-01-31 12:46:00,674 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 12:46:00,674 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:46:00,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:46:00,675 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-01-31 12:46:00,676 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-01-31 12:46:00,713 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 12:46:00,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:46:00,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-31 12:46:00,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:46:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 377 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-31 12:46:00,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:46:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 377 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-31 12:46:01,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689484163] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:46:01,436 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:46:01,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 36 [2022-01-31 12:46:01,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069362628] [2022-01-31 12:46:01,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:46:01,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-31 12:46:01,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:46:01,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-31 12:46:01,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2022-01-31 12:46:01,437 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-01-31 12:46:09,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:46:09,984 INFO L93 Difference]: Finished difference Result 121 states and 155 transitions. [2022-01-31 12:46:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-31 12:46:09,985 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-01-31 12:46:09,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:46:09,986 INFO L225 Difference]: With dead ends: 121 [2022-01-31 12:46:09,986 INFO L226 Difference]: Without dead ends: 107 [2022-01-31 12:46:09,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=916, Invalid=3776, Unknown=0, NotChecked=0, Total=4692 [2022-01-31 12:46:09,987 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 436 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 12:46:09,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 157 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 12:46:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-31 12:46:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2022-01-31 12:46:09,992 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-01-31 12:46:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2022-01-31 12:46:09,993 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 65 [2022-01-31 12:46:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:46:09,993 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2022-01-31 12:46:09,993 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-01-31 12:46:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2022-01-31 12:46:09,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-31 12:46:09,994 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:46:09,995 INFO L514 BasicCegarLoop]: trace histogram [31, 31, 22, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:46:10,014 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-01-31 12:46:10,207 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-01-31 12:46:10,207 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:46:10,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:46:10,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1862805289, now seen corresponding path program 5 times [2022-01-31 12:46:10,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:46:10,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143317006] [2022-01-31 12:46:10,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:46:10,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:46:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:46:10,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:46:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:46:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 628 proven. 126 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2022-01-31 12:46:10,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:46:10,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143317006] [2022-01-31 12:46:10,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143317006] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:46:10,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826318694] [2022-01-31 12:46:10,396 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 12:46:10,396 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:46:10,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:46:10,397 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-01-31 12:46:10,398 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-01-31 12:46:23,630 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2022-01-31 12:46:23,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:46:23,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-31 12:46:23,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:46:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-01-31 12:46:24,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:46:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-01-31 12:46:25,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826318694] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:46:25,455 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:46:25,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 27, 27] total 61 [2022-01-31 12:46:25,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612904059] [2022-01-31 12:46:25,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:46:25,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-01-31 12:46:25,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:46:25,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-01-31 12:46:25,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=3003, Unknown=0, NotChecked=0, Total=3660 [2022-01-31 12:46:25,458 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-01-31 12:47:45,984 WARN L228 SmtUtils]: Spent 46.69s 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-01-31 12:47:48,388 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (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 (+ 4294967275 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967291 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 (+ 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 (+ 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 (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-01-31 12:48:41,210 WARN L228 SmtUtils]: Spent 26.79s on a formula simplification that was a NOOP. DAG size: 112 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:49:32,854 WARN L228 SmtUtils]: Spent 28.14s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:49:34,872 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (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 (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967291 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 (+ 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 (+ 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 (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-01-31 12:49:36,881 WARN L838 $PredicateComparison]: unable to prove that (and (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 (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967291 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 (+ 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 (+ 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 (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0))) is different from false [2022-01-31 12:50:23,730 WARN L228 SmtUtils]: Spent 24.12s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:51:15,419 WARN L228 SmtUtils]: Spent 30.41s 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-01-31 12:51:20,241 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967291 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 (+ 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 (+ 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 (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-01-31 12:52:00,125 WARN L228 SmtUtils]: Spent 23.46s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:52:32,620 WARN L228 SmtUtils]: Spent 13.61s 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-01-31 12:53:07,309 WARN L228 SmtUtils]: Spent 17.97s on a formula simplification that was a NOOP. DAG size: 100 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:53:42,837 WARN L228 SmtUtils]: Spent 13.68s 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-01-31 12:54:05,336 WARN L228 SmtUtils]: Spent 9.65s 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-01-31 12:54:32,164 WARN L228 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:55:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:55:17,535 INFO L93 Difference]: Finished difference Result 214 states and 286 transitions. [2022-01-31 12:55:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-01-31 12:55:17,535 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-01-31 12:55:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:55:17,537 INFO L225 Difference]: With dead ends: 214 [2022-01-31 12:55:17,537 INFO L226 Difference]: Without dead ends: 188 [2022-01-31 12:55:17,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1972 ImplicationChecksByTransitivity, 522.9s TimeCoverageRelationStatistics Valid=3110, Invalid=11396, Unknown=30, NotChecked=964, Total=15500 [2022-01-31 12:55:17,541 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 1177 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 3548 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 3659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 3548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-01-31 12:55:17,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1177 Valid, 241 Invalid, 3659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 3548 Invalid, 0 Unknown, 11 Unchecked, 10.4s Time] [2022-01-31 12:55:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-01-31 12:55:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 183. [2022-01-31 12:55:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 178 states have (on average 1.2752808988764044) internal successors, (227), 178 states have internal predecessors, (227), 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-01-31 12:55:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 231 transitions. [2022-01-31 12:55:17,553 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 231 transitions. Word has length 104 [2022-01-31 12:55:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:55:17,553 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 231 transitions. [2022-01-31 12:55:17,553 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-01-31 12:55:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 231 transitions. [2022-01-31 12:55:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-31 12:55:17,554 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:55:17,555 INFO L514 BasicCegarLoop]: trace histogram [35, 35, 24, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:55:17,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 12:55:17,755 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-01-31 12:55:17,755 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:55:17,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:55:17,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1011259575, now seen corresponding path program 6 times [2022-01-31 12:55:17,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:55:17,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932970289] [2022-01-31 12:55:17,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:17,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:55:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:17,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:55:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 789 proven. 155 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2022-01-31 12:55:17,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:55:17,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932970289] [2022-01-31 12:55:17,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932970289] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:55:17,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057772443] [2022-01-31 12:55:17,987 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 12:55:17,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:17,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:55:17,988 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-01-31 12:55:17,991 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-01-31 12:55:18,035 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-31 12:55:18,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:55:18,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:55:18,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:55:18,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2022-01-31 12:55:18,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:55:18,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057772443] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:55:18,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:55:18,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2022-01-31 12:55:18,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962225776] [2022-01-31 12:55:18,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:55:18,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 12:55:18,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:55:18,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 12:55:18,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-01-31 12:55:18,310 INFO L87 Difference]: Start difference. First operand 183 states and 231 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:55:18,343 INFO L93 Difference]: Finished difference Result 400 states and 491 transitions. [2022-01-31 12:55:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 12:55:18,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 116 [2022-01-31 12:55:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:55:18,345 INFO L225 Difference]: With dead ends: 400 [2022-01-31 12:55:18,345 INFO L226 Difference]: Without dead ends: 400 [2022-01-31 12:55:18,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-01-31 12:55:18,346 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:55:18,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 12:55:18,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-01-31 12:55:18,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 180. [2022-01-31 12:55:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 175 states have (on average 1.2685714285714285) internal successors, (222), 175 states have internal predecessors, (222), 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-01-31 12:55:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 226 transitions. [2022-01-31 12:55:18,354 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 226 transitions. Word has length 116 [2022-01-31 12:55:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:55:18,355 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 226 transitions. [2022-01-31 12:55:18,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 226 transitions. [2022-01-31 12:55:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-31 12:55:18,356 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:55:18,356 INFO L514 BasicCegarLoop]: trace histogram [36, 36, 25, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:55:18,375 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-01-31 12:55:18,567 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-01-31 12:55:18,568 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:55:18,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:55:18,568 INFO L85 PathProgramCache]: Analyzing trace with hash -110207291, now seen corresponding path program 7 times [2022-01-31 12:55:18,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:55:18,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232714963] [2022-01-31 12:55:18,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:18,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:55:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:18,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:55:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 821 proven. 155 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2022-01-31 12:55:18,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:55:18,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232714963] [2022-01-31 12:55:18,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232714963] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:55:18,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464639550] [2022-01-31 12:55:18,793 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 12:55:18,793 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:18,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:55:18,794 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-01-31 12:55:18,795 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-01-31 12:55:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:18,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-31 12:55:18,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:55:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1768 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2022-01-31 12:55:19,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:55:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1768 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2022-01-31 12:55:20,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464639550] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:55:20,887 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:55:20,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 30, 30] total 68 [2022-01-31 12:55:20,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104784308] [2022-01-31 12:55:20,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:55:20,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-31 12:55:20,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:55:20,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-31 12:55:20,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=3737, Unknown=0, NotChecked=0, Total=4556 [2022-01-31 12:55:20,893 INFO L87 Difference]: Start difference. First operand 180 states and 226 transitions. Second operand has 68 states, 68 states have (on average 3.0294117647058822) internal successors, (206), 66 states have internal predecessors, (206), 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-01-31 12:55:24,867 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (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 (+ 4294967275 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967291 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 (+ 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 (+ 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 (+ 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 (+ 4294967274 c_main_~z~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-01-31 12:56:57,502 WARN L228 SmtUtils]: Spent 54.87s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:58:20,794 WARN L228 SmtUtils]: Spent 44.73s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:59:58,111 WARN L228 SmtUtils]: Spent 56.36s on a formula simplification that was a NOOP. DAG size: 133 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 13:00:03,513 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (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 (+ 4294967275 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967291 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 (+ 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 (+ 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 (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 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 (+ 4294967274 c_main_~z~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false