/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-17 15:12:09,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 15:12:09,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 15:12:09,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 15:12:09,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 15:12:09,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 15:12:09,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 15:12:09,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 15:12:09,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 15:12:09,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 15:12:09,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 15:12:09,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 15:12:09,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 15:12:09,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 15:12:09,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 15:12:09,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 15:12:09,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 15:12:09,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 15:12:09,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 15:12:09,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 15:12:09,364 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 15:12:09,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 15:12:09,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 15:12:09,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 15:12:09,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 15:12:09,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 15:12:09,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 15:12:09,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 15:12:09,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 15:12:09,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 15:12:09,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 15:12:09,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 15:12:09,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 15:12:09,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 15:12:09,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 15:12:09,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 15:12:09,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 15:12:09,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 15:12:09,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 15:12:09,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 15:12:09,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 15:12:09,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 15:12:09,378 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-17 15:12:09,385 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 15:12:09,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 15:12:09,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 15:12:09,386 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-17 15:12:09,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 15:12:09,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-17 15:12:09,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 15:12:09,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 15:12:09,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 15:12:09,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 15:12:09,387 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-17 15:12:09,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 15:12:09,387 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 15:12:09,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 15:12:09,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 15:12:09,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 15:12:09,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-17 15:12:09,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 15:12:09,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:12:09,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 15:12:09,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 15:12:09,389 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 15:12:09,389 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-03-17 15:12:09,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 15:12:09,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 15:12:09,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 15:12:09,598 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 15:12:09,607 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 15:12:09,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-03-17 15:12:09,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029cf4c8a/44eaf5c550244b589ea29d0671a54a79/FLAG347a50cf2 [2022-03-17 15:12:10,058 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 15:12:10,059 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-03-17 15:12:10,063 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029cf4c8a/44eaf5c550244b589ea29d0671a54a79/FLAG347a50cf2 [2022-03-17 15:12:10,077 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029cf4c8a/44eaf5c550244b589ea29d0671a54a79 [2022-03-17 15:12:10,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 15:12:10,081 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 15:12:10,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 15:12:10,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 15:12:10,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 15:12:10,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:12:10" (1/1) ... [2022-03-17 15:12:10,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@690615b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:10, skipping insertion in model container [2022-03-17 15:12:10,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:12:10" (1/1) ... [2022-03-17 15:12:10,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 15:12:10,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 15:12:10,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/Mono1_1-2.c[313,326] [2022-03-17 15:12:10,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:12:10,249 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 15:12:10,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c[313,326] [2022-03-17 15:12:10,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:12:10,270 INFO L208 MainTranslator]: Completed translation [2022-03-17 15:12:10,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:10 WrapperNode [2022-03-17 15:12:10,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 15:12:10,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 15:12:10,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 15:12:10,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 15:12:10,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:10" (1/1) ... [2022-03-17 15:12:10,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:10" (1/1) ... [2022-03-17 15:12:10,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:10" (1/1) ... [2022-03-17 15:12:10,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:10" (1/1) ... [2022-03-17 15:12:10,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:10" (1/1) ... [2022-03-17 15:12:10,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:10" (1/1) ... [2022-03-17 15:12:10,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:10" (1/1) ... [2022-03-17 15:12:10,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 15:12:10,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 15:12:10,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 15:12:10,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 15:12:10,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:10" (1/1) ... [2022-03-17 15:12:10,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:12:10,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:12:10,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-17 15:12:10,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 15:12:10,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 15:12:10,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-17 15:12:10,364 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 15:12:10,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-17 15:12:10,365 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 15:12:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 15:12:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 15:12:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 15:12:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 15:12:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 15:12:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 15:12:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 15:12:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 15:12:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 15:12:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 15:12:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 15:12:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 15:12:10,422 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 15:12:10,423 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 15:12:10,506 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 15:12:10,510 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 15:12:10,511 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-17 15:12:10,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:12:10 BoogieIcfgContainer [2022-03-17 15:12:10,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 15:12:10,513 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 15:12:10,513 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 15:12:10,530 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 15:12:10,533 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:12:10" (1/1) ... [2022-03-17 15:12:10,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:12:10 BasicIcfg [2022-03-17 15:12:10,554 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 15:12:10,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 15:12:10,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 15:12:10,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 15:12:10,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:12:10" (1/4) ... [2022-03-17 15:12:10,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44040acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:12:10, skipping insertion in model container [2022-03-17 15:12:10,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:10" (2/4) ... [2022-03-17 15:12:10,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44040acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:12:10, skipping insertion in model container [2022-03-17 15:12:10,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:12:10" (3/4) ... [2022-03-17 15:12:10,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44040acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:12:10, skipping insertion in model container [2022-03-17 15:12:10,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:12:10" (4/4) ... [2022-03-17 15:12:10,573 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.cJordan [2022-03-17 15:12:10,577 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-17 15:12:10,578 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 15:12:10,615 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 15:12:10,620 INFO L340 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 [2022-03-17 15:12:10,628 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 15:12:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-17 15:12:10,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-17 15:12:10,642 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:12:10,643 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:12:10,643 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:12:10,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:12:10,647 INFO L85 PathProgramCache]: Analyzing trace with hash -756157467, now seen corresponding path program 1 times [2022-03-17 15:12:10,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:12:10,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453585462] [2022-03-17 15:12:10,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:12:10,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:12:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:10,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:12:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:12:10,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:12:10,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453585462] [2022-03-17 15:12:10,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453585462] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:12:10,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:12:10,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-17 15:12:10,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042192873] [2022-03-17 15:12:10,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:12:10,817 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-17 15:12:10,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:12:10,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-17 15:12:10,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 15:12:10,845 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:10,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:12:10,880 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-03-17 15:12:10,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-17 15:12:10,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-17 15:12:10,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:12:10,894 INFO L225 Difference]: With dead ends: 19 [2022-03-17 15:12:10,895 INFO L226 Difference]: Without dead ends: 13 [2022-03-17 15:12:10,898 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 15:12:10,905 INFO L912 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:12:10,906 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 15:12:10,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-03-17 15:12:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-03-17 15:12:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-03-17 15:12:10,931 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-03-17 15:12:10,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:12:10,931 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-03-17 15:12:10,932 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-03-17 15:12:10,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-17 15:12:10,932 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:12:10,932 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:12:10,933 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 15:12:10,933 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:12:10,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:12:10,939 INFO L85 PathProgramCache]: Analyzing trace with hash -755233946, now seen corresponding path program 1 times [2022-03-17 15:12:10,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:12:10,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623684521] [2022-03-17 15:12:10,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:12:10,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:12:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:11,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:12:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:12:11,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:12:11,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623684521] [2022-03-17 15:12:11,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623684521] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:12:11,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:12:11,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 15:12:11,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916360565] [2022-03-17 15:12:11,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:12:11,075 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 15:12:11,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:12:11,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 15:12:11,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 15:12:11,076 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:12:11,120 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-03-17 15:12:11,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-17 15:12:11,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-17 15:12:11,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:12:11,122 INFO L225 Difference]: With dead ends: 15 [2022-03-17 15:12:11,122 INFO L226 Difference]: Without dead ends: 15 [2022-03-17 15:12:11,126 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-17 15:12:11,127 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:12:11,128 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 15:12:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-03-17 15:12:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-03-17 15:12:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-03-17 15:12:11,139 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-03-17 15:12:11,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:12:11,140 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-03-17 15:12:11,140 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-03-17 15:12:11,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-17 15:12:11,141 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:12:11,142 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:12:11,143 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 15:12:11,144 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:12:11,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:12:11,144 INFO L85 PathProgramCache]: Analyzing trace with hash 980092676, now seen corresponding path program 1 times [2022-03-17 15:12:11,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:12:11,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98253586] [2022-03-17 15:12:11,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:12:11,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:12:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:11,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:12:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:12:11,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:12:11,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98253586] [2022-03-17 15:12:11,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98253586] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:12:11,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616427464] [2022-03-17 15:12:11,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:12:11,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:12:11,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:12:11,228 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:12:11,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-17 15:12:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:11,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-17 15:12:11,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:12:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:12:11,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:12:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:12:11,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616427464] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:12:11,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:12:11,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 7] total 11 [2022-03-17 15:12:11,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079479024] [2022-03-17 15:12:11,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:12:11,511 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-17 15:12:11,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:12:11,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-17 15:12:11,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-17 15:12:11,512 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:12:11,630 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-03-17 15:12:11,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 15:12:11,631 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-03-17 15:12:11,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:12:11,632 INFO L225 Difference]: With dead ends: 18 [2022-03-17 15:12:11,632 INFO L226 Difference]: Without dead ends: 18 [2022-03-17 15:12:11,632 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-03-17 15:12:11,633 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:12:11,633 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 15:12:11,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-03-17 15:12:11,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-03-17 15:12:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-03-17 15:12:11,636 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-03-17 15:12:11,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:12:11,637 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-03-17 15:12:11,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-03-17 15:12:11,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 15:12:11,637 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:12:11,637 INFO L500 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:12:11,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-17 15:12:11,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:12:11,860 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:12:11,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:12:11,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1575643231, now seen corresponding path program 1 times [2022-03-17 15:12:11,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:12:11,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025902876] [2022-03-17 15:12:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:12:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:12:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:12:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:12:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:12:11,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025902876] [2022-03-17 15:12:11,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025902876] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:12:11,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312951975] [2022-03-17 15:12:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:12:11,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:12:11,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:12:11,971 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:12:11,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-17 15:12:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:12,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-17 15:12:12,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:12:12,096 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:12:12,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:12:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:12:12,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312951975] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:12:12,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:12:12,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-03-17 15:12:12,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116708597] [2022-03-17 15:12:12,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:12:12,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-17 15:12:12,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:12:12,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-17 15:12:12,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-03-17 15:12:12,233 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:12,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:12:12,477 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-03-17 15:12:12,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-17 15:12:12,477 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-17 15:12:12,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:12:12,478 INFO L225 Difference]: With dead ends: 26 [2022-03-17 15:12:12,478 INFO L226 Difference]: Without dead ends: 26 [2022-03-17 15:12:12,479 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2022-03-17 15:12:12,479 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:12:12,480 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 29 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 15:12:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-03-17 15:12:12,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-03-17 15:12:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-03-17 15:12:12,483 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 17 [2022-03-17 15:12:12,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:12:12,484 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-03-17 15:12:12,484 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-03-17 15:12:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-17 15:12:12,485 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:12:12,485 INFO L500 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:12:12,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-17 15:12:12,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-17 15:12:12,695 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:12:12,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:12:12,696 INFO L85 PathProgramCache]: Analyzing trace with hash 109985751, now seen corresponding path program 2 times [2022-03-17 15:12:12,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:12:12,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691584784] [2022-03-17 15:12:12,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:12:12,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:12:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:12,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:12:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:12:12,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:12:12,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691584784] [2022-03-17 15:12:12,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691584784] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:12:12,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008716266] [2022-03-17 15:12:12,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:12:12,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:12:12,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:12:12,870 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:12:12,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-17 15:12:12,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:12:12,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:12:12,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-17 15:12:12,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:12:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:12:13,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:12:13,371 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:12:13,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008716266] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:12:13,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:12:13,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 23 [2022-03-17 15:12:13,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194969515] [2022-03-17 15:12:13,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:12:13,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-17 15:12:13,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:12:13,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-17 15:12:13,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-03-17 15:12:13,373 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:14,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:12:14,623 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-03-17 15:12:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-17 15:12:14,624 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-03-17 15:12:14,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:12:14,625 INFO L225 Difference]: With dead ends: 39 [2022-03-17 15:12:14,625 INFO L226 Difference]: Without dead ends: 36 [2022-03-17 15:12:14,626 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=311, Invalid=1095, Unknown=0, NotChecked=0, Total=1406 [2022-03-17 15:12:14,627 INFO L912 BasicCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-17 15:12:14,627 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 66 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-17 15:12:14,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-17 15:12:14,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-03-17 15:12:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-03-17 15:12:14,631 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2022-03-17 15:12:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:12:14,632 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-03-17 15:12:14,632 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-03-17 15:12:14,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-17 15:12:14,633 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:12:14,633 INFO L500 BasicCegarLoop]: trace histogram [12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:12:14,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-17 15:12:14,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:12:14,844 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:12:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:12:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash 134643049, now seen corresponding path program 3 times [2022-03-17 15:12:14,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:12:14,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654254119] [2022-03-17 15:12:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:12:14,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:12:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:14,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:12:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-17 15:12:15,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:12:15,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654254119] [2022-03-17 15:12:15,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654254119] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:12:15,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41462921] [2022-03-17 15:12:15,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-17 15:12:15,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:12:15,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:12:15,008 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:12:15,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-17 15:12:15,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-03-17 15:12:15,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:12:15,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-17 15:12:15,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:12:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-17 15:12:15,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:12:15,928 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-17 15:12:15,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41462921] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:12:15,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:12:15,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 12] total 27 [2022-03-17 15:12:15,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269833011] [2022-03-17 15:12:15,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:12:15,929 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-17 15:12:15,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:12:15,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-17 15:12:15,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2022-03-17 15:12:15,930 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:12:19,712 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-03-17 15:12:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-17 15:12:19,712 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-03-17 15:12:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:12:19,713 INFO L225 Difference]: With dead ends: 57 [2022-03-17 15:12:19,713 INFO L226 Difference]: Without dead ends: 54 [2022-03-17 15:12:19,714 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=563, Invalid=2089, Unknown=0, NotChecked=0, Total=2652 [2022-03-17 15:12:19,715 INFO L912 BasicCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-17 15:12:19,715 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 66 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-17 15:12:19,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-03-17 15:12:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-03-17 15:12:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-03-17 15:12:19,720 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 35 [2022-03-17 15:12:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:12:19,720 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-03-17 15:12:19,720 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-03-17 15:12:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-17 15:12:19,721 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:12:19,721 INFO L500 BasicCegarLoop]: trace histogram [20, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:12:19,729 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-03-17 15:12:19,926 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:12:19,926 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:12:19,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:12:19,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1228107086, now seen corresponding path program 4 times [2022-03-17 15:12:19,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:12:19,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899252787] [2022-03-17 15:12:19,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:12:19,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:12:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:20,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:12:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-03-17 15:12:20,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:12:20,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899252787] [2022-03-17 15:12:20,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899252787] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:12:20,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588191803] [2022-03-17 15:12:20,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-17 15:12:20,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:12:20,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:12:20,150 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:12:20,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-17 15:12:20,201 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-17 15:12:20,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:12:20,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-17 15:12:20,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:12:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-17 15:12:20,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:12:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-17 15:12:21,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588191803] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:12:21,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:12:21,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 19] total 37 [2022-03-17 15:12:21,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178930058] [2022-03-17 15:12:21,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:12:21,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-17 15:12:21,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:12:21,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-17 15:12:21,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=962, Unknown=0, NotChecked=0, Total=1332 [2022-03-17 15:12:21,357 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:12:47,634 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-03-17 15:12:47,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-17 15:12:47,635 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-03-17 15:12:47,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:12:47,636 INFO L225 Difference]: With dead ends: 86 [2022-03-17 15:12:47,636 INFO L226 Difference]: Without dead ends: 86 [2022-03-17 15:12:47,637 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=1061, Invalid=2845, Unknown=0, NotChecked=0, Total=3906 [2022-03-17 15:12:47,637 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-17 15:12:47,638 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 104 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-17 15:12:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-03-17 15:12:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-03-17 15:12:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:47,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-03-17 15:12:47,644 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 51 [2022-03-17 15:12:47,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:12:47,644 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-03-17 15:12:47,644 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:12:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-03-17 15:12:47,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-03-17 15:12:47,646 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:12:47,646 INFO L500 BasicCegarLoop]: trace histogram [37, 25, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:12:47,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-17 15:12:47,855 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:12:47,855 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:12:47,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:12:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash 525547056, now seen corresponding path program 5 times [2022-03-17 15:12:47,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:12:47,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445838341] [2022-03-17 15:12:47,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:12:47,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:12:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:48,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:12:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:12:48,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 598 proven. 650 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-03-17 15:12:48,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:12:48,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445838341] [2022-03-17 15:12:48,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445838341] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:12:48,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732207002] [2022-03-17 15:12:48,417 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-17 15:12:48,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:12:48,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:12:48,420 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:12:48,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-17 15:12:57,201 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2022-03-17 15:12:57,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:12:57,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-17 15:12:57,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:12:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 352 proven. 992 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-17 15:12:57,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:13:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 352 proven. 992 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-17 15:13:00,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732207002] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:13:00,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:13:00,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 34, 35] total 69 [2022-03-17 15:13:00,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682116079] [2022-03-17 15:13:00,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:13:00,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-03-17 15:13:00,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:13:00,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-03-17 15:13:00,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1251, Invalid=3441, Unknown=0, NotChecked=0, Total=4692 [2022-03-17 15:13:00,284 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:13:54,211 WARN L232 SmtUtils]: Spent 18.57s on a formula simplification. DAG size of input: 230 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:14:19,674 WARN L232 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 223 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:14:54,331 WARN L232 SmtUtils]: Spent 11.76s on a formula simplification. DAG size of input: 216 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:15:25,894 WARN L232 SmtUtils]: Spent 9.50s on a formula simplification. DAG size of input: 209 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:15:27,927 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse25 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse25 10000000) (not (< .cse25 100000000)))) (let ((.cse26 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000))))) is different from false [2022-03-17 15:15:29,956 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse25 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse25 10000000) (not (< .cse25 100000000)))) (let ((.cse26 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000))))) is different from false [2022-03-17 15:16:01,652 WARN L232 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 152 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:16:31,631 WARN L232 SmtUtils]: Spent 9.57s on a formula simplification. DAG size of input: 158 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:17:08,424 WARN L232 SmtUtils]: Spent 7.51s on a formula simplification. DAG size of input: 188 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:18:05,853 WARN L232 SmtUtils]: Spent 24.11s on a formula simplification. DAG size of input: 200 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:18:33,398 WARN L232 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 181 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:19:31,081 WARN L232 SmtUtils]: Spent 25.69s on a formula simplification. DAG size of input: 207 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:20:04,420 WARN L232 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 174 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:20:56,804 WARN L232 SmtUtils]: Spent 28.25s on a formula simplification. DAG size of input: 214 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:21:31,011 WARN L232 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 167 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:21:33,031 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse10 100000000)) (< .cse10 10000000))) (let ((.cse11 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ c_main_~x~0 37) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse28 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000))))) is different from false [2022-03-17 15:21:35,043 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (let ((.cse1 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 17 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 25 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 21 c_main_~x~0) 4294967296))) (or (not (< .cse10 100000000)) (< .cse10 10000000))) (let ((.cse11 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 13 c_main_~x~0) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 33 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 29 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 15 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ c_main_~x~0 37) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ c_main_~x~0 27) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ 19 c_main_~x~0) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000))))) is different from false [2022-03-17 15:23:35,738 WARN L232 SmtUtils]: Spent 32.73s on a formula simplification. DAG size of input: 233 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:26:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:26:08,791 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2022-03-17 15:26:08,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-17 15:26:08,792 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-03-17 15:26:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:26:08,793 INFO L225 Difference]: With dead ends: 164 [2022-03-17 15:26:08,793 INFO L226 Difference]: Without dead ends: 164 [2022-03-17 15:26:08,797 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 135 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 788.6s TimeCoverageRelationStatistics Valid=4588, Invalid=12943, Unknown=41, NotChecked=1060, Total=18632 [2022-03-17 15:26:08,798 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 105 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-17 15:26:08,798 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 183 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 2042 Invalid, 0 Unknown, 4 Unchecked, 2.6s Time] [2022-03-17 15:26:08,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-03-17 15:26:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2022-03-17 15:26:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 157 states have (on average 1.0573248407643312) internal successors, (166), 157 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 170 transitions. [2022-03-17 15:26:08,807 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 170 transitions. Word has length 85 [2022-03-17 15:26:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:26:08,807 INFO L478 AbstractCegarLoop]: Abstraction has 162 states and 170 transitions. [2022-03-17 15:26:08,808 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 68 states have internal predecessors, (142), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 170 transitions. [2022-03-17 15:26:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-03-17 15:26:08,811 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:26:08,811 INFO L500 BasicCegarLoop]: trace histogram [70, 58, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:26:08,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-17 15:26:09,015 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:26:09,016 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:26:09,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:26:09,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1736138738, now seen corresponding path program 6 times [2022-03-17 15:26:09,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:26:09,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934575090] [2022-03-17 15:26:09,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:09,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:26:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:10,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:26:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1357 proven. 3422 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-03-17 15:26:10,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:26:10,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934575090] [2022-03-17 15:26:10,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934575090] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:26:10,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039882522] [2022-03-17 15:26:10,699 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-17 15:26:10,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:26:10,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:26:10,700 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:26:10,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-17 15:26:32,172 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2022-03-17 15:26:32,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:26:32,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-17 15:26:32,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:26:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2022 proven. 984 refuted. 0 times theorem prover too weak. 1894 trivial. 0 not checked. [2022-03-17 15:26:34,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:26:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1450 proven. 144 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2022-03-17 15:26:37,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039882522] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:26:37,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:26:37,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 28, 19] total 105 [2022-03-17 15:26:37,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455883549] [2022-03-17 15:26:37,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:26:37,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2022-03-17 15:26:37,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:26:37,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2022-03-17 15:26:37,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2717, Invalid=8203, Unknown=0, NotChecked=0, Total=10920 [2022-03-17 15:26:37,089 INFO L87 Difference]: Start difference. First operand 162 states and 170 transitions. Second operand has 105 states, 104 states have (on average 2.0384615384615383) internal successors, (212), 103 states have internal predecessors, (212), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)