/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 18:53:50,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 18:53:50,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 18:53:50,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 18:53:50,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 18:53:50,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 18:53:50,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 18:53:50,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 18:53:50,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 18:53:50,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 18:53:50,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 18:53:50,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 18:53:50,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 18:53:50,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 18:53:50,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 18:53:50,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 18:53:50,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 18:53:50,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 18:53:50,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 18:53:50,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 18:53:50,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 18:53:50,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 18:53:50,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 18:53:50,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 18:53:50,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 18:53:50,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 18:53:50,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 18:53:50,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 18:53:50,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 18:53:50,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 18:53:50,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 18:53:50,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 18:53:50,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 18:53:50,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 18:53:50,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 18:53:50,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 18:53:50,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 18:53:50,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 18:53:50,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 18:53:50,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 18:53:50,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 18:53:50,140 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 18:53:50,167 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 18:53:50,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 18:53:50,168 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 18:53:50,168 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 18:53:50,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 18:53:50,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 18:53:50,169 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 18:53:50,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 18:53:50,169 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 18:53:50,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 18:53:50,169 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 18:53:50,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 18:53:50,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 18:53:50,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 18:53:50,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 18:53:50,170 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 18:53:50,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 18:53:50,170 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 18:53:50,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 18:53:50,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 18:53:50,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 18:53:50,171 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 18:53:50,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 18:53:50,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:53:50,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 18:53:50,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 18:53:50,171 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 18:53:50,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 18:53:50,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 18:53:50,171 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 18:53:50,172 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 18:53:50,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 18:53:50,172 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 [2022-03-15 18:53:50,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 18:53:50,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 18:53:50,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 18:53:50,388 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 18:53:50,388 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 18:53:50,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2022-03-15 18:53:50,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7657e3ca8/971b2b52f32f4972836367a2c6ee5725/FLAGfc5c28ae8 [2022-03-15 18:53:50,772 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 18:53:50,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2022-03-15 18:53:50,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7657e3ca8/971b2b52f32f4972836367a2c6ee5725/FLAGfc5c28ae8 [2022-03-15 18:53:50,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7657e3ca8/971b2b52f32f4972836367a2c6ee5725 [2022-03-15 18:53:50,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 18:53:50,787 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 18:53:50,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 18:53:50,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 18:53:50,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 18:53:50,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:53:50" (1/1) ... [2022-03-15 18:53:50,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f12331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:50, skipping insertion in model container [2022-03-15 18:53:50,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:53:50" (1/1) ... [2022-03-15 18:53:50,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 18:53:50,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 18:53:50,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c[2856,2869] [2022-03-15 18:53:50,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:53:50,997 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 18:53:51,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c[2856,2869] [2022-03-15 18:53:51,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:53:51,021 INFO L208 MainTranslator]: Completed translation [2022-03-15 18:53:51,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:51 WrapperNode [2022-03-15 18:53:51,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 18:53:51,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 18:53:51,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 18:53:51,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 18:53:51,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:51" (1/1) ... [2022-03-15 18:53:51,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:51" (1/1) ... [2022-03-15 18:53:51,053 INFO L137 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-03-15 18:53:51,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 18:53:51,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 18:53:51,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 18:53:51,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 18:53:51,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:51" (1/1) ... [2022-03-15 18:53:51,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:51" (1/1) ... [2022-03-15 18:53:51,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:51" (1/1) ... [2022-03-15 18:53:51,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:51" (1/1) ... [2022-03-15 18:53:51,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:51" (1/1) ... [2022-03-15 18:53:51,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:51" (1/1) ... [2022-03-15 18:53:51,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:51" (1/1) ... [2022-03-15 18:53:51,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 18:53:51,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 18:53:51,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 18:53:51,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 18:53:51,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:51" (1/1) ... [2022-03-15 18:53:51,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:53:51,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:51,112 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-15 18:53:51,115 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-15 18:53:51,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 18:53:51,151 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 18:53:51,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 18:53:51,151 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 18:53:51,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 18:53:51,151 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 18:53:51,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 18:53:51,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 18:53:51,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 18:53:51,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 18:53:51,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 18:53:51,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 18:53:51,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 18:53:51,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 18:53:51,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 18:53:51,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 18:53:51,152 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 18:53:51,237 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 18:53:51,238 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 18:53:51,454 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 18:53:51,467 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 18:53:51,468 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 18:53:51,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:53:51 BoogieIcfgContainer [2022-03-15 18:53:51,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 18:53:51,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 18:53:51,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 18:53:51,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 18:53:51,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 06:53:50" (1/3) ... [2022-03-15 18:53:51,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa500b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:53:51, skipping insertion in model container [2022-03-15 18:53:51,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:53:51" (2/3) ... [2022-03-15 18:53:51,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa500b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:53:51, skipping insertion in model container [2022-03-15 18:53:51,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:53:51" (3/3) ... [2022-03-15 18:53:51,474 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2022-03-15 18:53:51,477 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 18:53:51,477 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 18:53:51,477 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 18:53:51,477 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 18:53:51,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,504 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,505 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,506 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,506 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,506 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,507 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,508 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,508 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,508 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,508 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,508 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,508 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,509 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,509 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,512 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,512 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,512 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,513 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,513 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,513 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:53:51,516 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 18:53:51,549 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 18:53:51,554 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 18:53:51,554 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 18:53:51,567 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 18:53:51,573 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 129 transitions, 282 flow [2022-03-15 18:53:51,578 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 129 transitions, 282 flow [2022-03-15 18:53:51,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 129 transitions, 282 flow [2022-03-15 18:53:51,642 INFO L129 PetriNetUnfolder]: 16/126 cut-off events. [2022-03-15 18:53:51,642 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 18:53:51,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 16/126 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 130 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 81. Up to 4 conditions per place. [2022-03-15 18:53:51,650 INFO L116 LiptonReduction]: Number of co-enabled transitions 2958 [2022-03-15 18:53:54,847 INFO L131 LiptonReduction]: Checked pairs total: 3060 [2022-03-15 18:53:54,847 INFO L133 LiptonReduction]: Total number of compositions: 125 [2022-03-15 18:53:54,853 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 23 transitions, 70 flow [2022-03-15 18:53:54,868 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 44 states, 43 states have (on average 2.883720930232558) internal successors, (124), 43 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 43 states have (on average 2.883720930232558) internal successors, (124), 43 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 18:53:54,874 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:54,874 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:54,874 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:54,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:54,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1270185667, now seen corresponding path program 1 times [2022-03-15 18:53:54,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:54,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140285500] [2022-03-15 18:53:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:54,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:55,058 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-15 18:53:55,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:55,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140285500] [2022-03-15 18:53:55,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140285500] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:55,059 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:55,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 18:53:55,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2052811983] [2022-03-15 18:53:55,061 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:55,065 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:55,085 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 80 transitions. [2022-03-15 18:53:55,086 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:55,390 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [217#(not (= (mod ~g1~0 256) 0))] [2022-03-15 18:53:55,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 18:53:55,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:55,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 18:53:55,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 18:53:55,410 INFO L87 Difference]: Start difference. First operand has 44 states, 43 states have (on average 2.883720930232558) internal successors, (124), 43 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:55,459 INFO L93 Difference]: Finished difference Result 58 states and 168 transitions. [2022-03-15 18:53:55,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 18:53:55,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 18:53:55,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:55,466 INFO L225 Difference]: With dead ends: 58 [2022-03-15 18:53:55,466 INFO L226 Difference]: Without dead ends: 58 [2022-03-15 18:53:55,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 18:53:55,468 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:55,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:53:55,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-15 18:53:55,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-03-15 18:53:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.9473684210526314) internal successors, (168), 57 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 168 transitions. [2022-03-15 18:53:55,491 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 168 transitions. Word has length 16 [2022-03-15 18:53:55,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:55,491 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 168 transitions. [2022-03-15 18:53:55,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 168 transitions. [2022-03-15 18:53:55,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 18:53:55,492 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:55,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:55,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 18:53:55,492 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:55,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:55,493 INFO L85 PathProgramCache]: Analyzing trace with hash 636067026, now seen corresponding path program 1 times [2022-03-15 18:53:55,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:55,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093139935] [2022-03-15 18:53:55,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:55,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:55,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:55,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093139935] [2022-03-15 18:53:55,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093139935] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:55,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:55,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 18:53:55,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [104211132] [2022-03-15 18:53:55,551 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:55,552 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:55,559 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 114 transitions. [2022-03-15 18:53:55,559 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:56,124 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [395#(not (= (mod ~g3~0 256) 0))] [2022-03-15 18:53:56,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 18:53:56,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:56,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 18:53:56,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 18:53:56,126 INFO L87 Difference]: Start difference. First operand 58 states and 168 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:56,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:56,158 INFO L93 Difference]: Finished difference Result 76 states and 226 transitions. [2022-03-15 18:53:56,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 18:53:56,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 18:53:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:56,159 INFO L225 Difference]: With dead ends: 76 [2022-03-15 18:53:56,159 INFO L226 Difference]: Without dead ends: 76 [2022-03-15 18:53:56,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 18:53:56,160 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:56,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:53:56,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-03-15 18:53:56,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-03-15 18:53:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 3.013333333333333) internal successors, (226), 75 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 226 transitions. [2022-03-15 18:53:56,179 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 226 transitions. Word has length 17 [2022-03-15 18:53:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:56,180 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 226 transitions. [2022-03-15 18:53:56,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 226 transitions. [2022-03-15 18:53:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 18:53:56,181 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:56,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:56,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 18:53:56,181 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:56,182 INFO L85 PathProgramCache]: Analyzing trace with hash -173598933, now seen corresponding path program 1 times [2022-03-15 18:53:56,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:56,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801120410] [2022-03-15 18:53:56,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:56,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:53:56,267 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:56,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801120410] [2022-03-15 18:53:56,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801120410] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:53:56,267 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:53:56,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 18:53:56,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1843974270] [2022-03-15 18:53:56,267 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:56,269 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:56,277 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 136 transitions. [2022-03-15 18:53:56,277 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:57,376 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [627#(not (= (mod ~g2~0 256) 0))] [2022-03-15 18:53:57,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 18:53:57,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:57,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 18:53:57,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 18:53:57,378 INFO L87 Difference]: Start difference. First operand 76 states and 226 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:57,409 INFO L93 Difference]: Finished difference Result 106 states and 325 transitions. [2022-03-15 18:53:57,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 18:53:57,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 18:53:57,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:57,411 INFO L225 Difference]: With dead ends: 106 [2022-03-15 18:53:57,411 INFO L226 Difference]: Without dead ends: 106 [2022-03-15 18:53:57,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 16 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 18:53:57,412 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:57,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:53:57,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-03-15 18:53:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-03-15 18:53:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 3.0952380952380953) internal successors, (325), 105 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 325 transitions. [2022-03-15 18:53:57,419 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 325 transitions. Word has length 18 [2022-03-15 18:53:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:57,419 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 325 transitions. [2022-03-15 18:53:57,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 325 transitions. [2022-03-15 18:53:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 18:53:57,420 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:57,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:57,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 18:53:57,420 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1970367494, now seen corresponding path program 1 times [2022-03-15 18:53:57,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:57,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582924681] [2022-03-15 18:53:57,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:57,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:53:57,510 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:57,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582924681] [2022-03-15 18:53:57,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582924681] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:57,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595312053] [2022-03-15 18:53:57,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:57,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:57,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:57,515 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-15 18:53:57,538 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-15 18:53:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:57,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 18:53:57,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:57,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:57,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:53:57,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595312053] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:53:57,884 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:53:57,884 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2022-03-15 18:53:57,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [44538576] [2022-03-15 18:53:57,884 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:57,887 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:57,894 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 123 transitions. [2022-03-15 18:53:57,895 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:53:58,707 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1064#(not (= (mod ~g1~0 256) 0)), 1065#(or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0))] [2022-03-15 18:53:58,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 18:53:58,708 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:53:58,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 18:53:58,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-03-15 18:53:58,708 INFO L87 Difference]: Start difference. First operand 106 states and 325 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:53:58,766 INFO L93 Difference]: Finished difference Result 132 states and 410 transitions. [2022-03-15 18:53:58,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 18:53:58,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 18:53:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:53:58,767 INFO L225 Difference]: With dead ends: 132 [2022-03-15 18:53:58,767 INFO L226 Difference]: Without dead ends: 132 [2022-03-15 18:53:58,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-03-15 18:53:58,768 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:53:58,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:53:58,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-03-15 18:53:58,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-03-15 18:53:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 3.1297709923664123) internal successors, (410), 131 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 410 transitions. [2022-03-15 18:53:58,774 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 410 transitions. Word has length 19 [2022-03-15 18:53:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:53:58,775 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 410 transitions. [2022-03-15 18:53:58,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:53:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 410 transitions. [2022-03-15 18:53:58,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 18:53:58,776 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:53:58,776 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:53:58,810 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-15 18:53:58,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:58,992 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:53:58,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:53:58,992 INFO L85 PathProgramCache]: Analyzing trace with hash -853978043, now seen corresponding path program 2 times [2022-03-15 18:53:58,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:53:58,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670254454] [2022-03-15 18:53:58,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:53:58,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:53:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:53:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 18:53:59,070 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:53:59,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670254454] [2022-03-15 18:53:59,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670254454] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:53:59,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826649364] [2022-03-15 18:53:59,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:53:59,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:53:59,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:53:59,084 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-15 18:53:59,139 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-15 18:53:59,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:53:59,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:53:59,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 18:53:59,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:53:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:53:59,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:53:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:53:59,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826649364] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:53:59,431 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:53:59,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2022-03-15 18:53:59,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2054790777] [2022-03-15 18:53:59,432 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:53:59,434 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:53:59,443 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 134 transitions. [2022-03-15 18:53:59,443 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:00,481 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1586#(not (= (mod ~g3~0 256) 0)), 1587#(or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0))] [2022-03-15 18:54:00,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 18:54:00,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:00,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 18:54:00,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-15 18:54:00,482 INFO L87 Difference]: Start difference. First operand 132 states and 410 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:00,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:00,541 INFO L93 Difference]: Finished difference Result 164 states and 516 transitions. [2022-03-15 18:54:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 18:54:00,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 18:54:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:00,543 INFO L225 Difference]: With dead ends: 164 [2022-03-15 18:54:00,543 INFO L226 Difference]: Without dead ends: 164 [2022-03-15 18:54:00,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 13 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-15 18:54:00,543 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:00,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:54:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-03-15 18:54:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-03-15 18:54:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 3.165644171779141) internal successors, (516), 163 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 516 transitions. [2022-03-15 18:54:00,550 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 516 transitions. Word has length 20 [2022-03-15 18:54:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:00,550 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 516 transitions. [2022-03-15 18:54:00,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 516 transitions. [2022-03-15 18:54:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 18:54:00,551 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:00,551 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:00,569 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-15 18:54:00,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:00,765 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:00,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:00,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1873028392, now seen corresponding path program 3 times [2022-03-15 18:54:00,767 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:00,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086731543] [2022-03-15 18:54:00,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:00,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 18:54:00,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:00,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086731543] [2022-03-15 18:54:00,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086731543] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:00,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815941508] [2022-03-15 18:54:00,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:54:00,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:00,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:00,819 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-15 18:54:00,821 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-15 18:54:00,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 18:54:00,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:00,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 18:54:00,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 18:54:00,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 18:54:01,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815941508] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:01,081 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:01,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-03-15 18:54:01,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1139537169] [2022-03-15 18:54:01,082 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:01,084 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:01,092 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 146 transitions. [2022-03-15 18:54:01,092 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:02,816 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:54:02,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 18:54:02,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:02,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 18:54:02,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 18:54:02,817 INFO L87 Difference]: Start difference. First operand 164 states and 516 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:02,866 INFO L93 Difference]: Finished difference Result 212 states and 676 transitions. [2022-03-15 18:54:02,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 18:54:02,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 18:54:02,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:02,868 INFO L225 Difference]: With dead ends: 212 [2022-03-15 18:54:02,868 INFO L226 Difference]: Without dead ends: 212 [2022-03-15 18:54:02,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 59 SyntacticMatches, 34 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 18:54:02,869 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:02,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:54:02,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-03-15 18:54:02,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-03-15 18:54:02,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 3.203791469194313) internal successors, (676), 211 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 676 transitions. [2022-03-15 18:54:02,882 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 676 transitions. Word has length 21 [2022-03-15 18:54:02,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:02,882 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 676 transitions. [2022-03-15 18:54:02,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:02,883 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 676 transitions. [2022-03-15 18:54:02,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:54:02,888 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:02,888 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:02,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 18:54:03,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:03,112 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:03,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:03,112 INFO L85 PathProgramCache]: Analyzing trace with hash -606502147, now seen corresponding path program 4 times [2022-03-15 18:54:03,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:03,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348367741] [2022-03-15 18:54:03,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:03,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:03,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:03,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348367741] [2022-03-15 18:54:03,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348367741] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:03,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636894823] [2022-03-15 18:54:03,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:54:03,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:03,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:03,430 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-15 18:54:03,431 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-15 18:54:03,484 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:54:03,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:03,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 18:54:03,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:03,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:54:04,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636894823] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:04,385 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:04,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 21 [2022-03-15 18:54:04,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2125888514] [2022-03-15 18:54:04,385 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:04,387 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:04,397 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 176 transitions. [2022-03-15 18:54:04,398 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:09,411 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [2995#(and (or (not (= 0 (mod ~d3~0 256))) (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (mod ~g3~0 256) 0))), 2996#(and (or (= 0 (mod ~d3~0 256)) (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0))), 2991#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 2998#(and (= ~d2~0 1) (= ~g2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)) (= ~g3~0 1)), 2992#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 2994#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g3~0 256) 0)))), 2993#(and (or (= ~g2~0 1) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)))), 2997#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)))] [2022-03-15 18:54:09,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 18:54:09,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:09,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 18:54:09,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:54:09,413 INFO L87 Difference]: Start difference. First operand 212 states and 676 transitions. Second operand has 19 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:11,565 INFO L93 Difference]: Finished difference Result 974 states and 3197 transitions. [2022-03-15 18:54:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 18:54:11,565 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:54:11,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:11,571 INFO L225 Difference]: With dead ends: 974 [2022-03-15 18:54:11,571 INFO L226 Difference]: Without dead ends: 946 [2022-03-15 18:54:11,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 63 SyntacticMatches, 24 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=706, Invalid=2954, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 18:54:11,573 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 249 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:11,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 0 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 18:54:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2022-03-15 18:54:11,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 472. [2022-03-15 18:54:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.6772823779193207) internal successors, (1732), 471 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1732 transitions. [2022-03-15 18:54:11,594 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1732 transitions. Word has length 22 [2022-03-15 18:54:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:11,595 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 1732 transitions. [2022-03-15 18:54:11,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1732 transitions. [2022-03-15 18:54:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:54:11,596 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:11,596 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:11,629 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-15 18:54:11,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:11,813 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:11,813 INFO L85 PathProgramCache]: Analyzing trace with hash 557793661, now seen corresponding path program 5 times [2022-03-15 18:54:11,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:11,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949380833] [2022-03-15 18:54:11,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:11,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:12,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:12,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949380833] [2022-03-15 18:54:12,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949380833] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:12,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643190466] [2022-03-15 18:54:12,125 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:54:12,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:12,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:12,140 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-15 18:54:12,141 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-15 18:54:12,221 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:54:12,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:12,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 18:54:12,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:12,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:13,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643190466] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:13,284 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:13,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 18:54:13,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [125048976] [2022-03-15 18:54:13,284 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:13,286 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:13,296 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 158 transitions. [2022-03-15 18:54:13,296 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:18,381 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [5131#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 5132#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 5133#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0))), 5134#(and (= ~d2~0 1) (= ~g2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)) (= ~g3~0 1)), 5130#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:54:18,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:54:18,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:18,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:54:18,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2022-03-15 18:54:18,383 INFO L87 Difference]: Start difference. First operand 472 states and 1732 transitions. Second operand has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:19,114 INFO L93 Difference]: Finished difference Result 829 states and 2904 transitions. [2022-03-15 18:54:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 18:54:19,114 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:54:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:19,118 INFO L225 Difference]: With dead ends: 829 [2022-03-15 18:54:19,118 INFO L226 Difference]: Without dead ends: 822 [2022-03-15 18:54:19,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 46 SyntacticMatches, 34 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=427, Invalid=1379, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 18:54:19,119 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:19,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:54:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-03-15 18:54:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 484. [2022-03-15 18:54:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 3.668737060041408) internal successors, (1772), 483 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1772 transitions. [2022-03-15 18:54:19,130 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1772 transitions. Word has length 22 [2022-03-15 18:54:19,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:19,130 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 1772 transitions. [2022-03-15 18:54:19,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1772 transitions. [2022-03-15 18:54:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:54:19,132 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:19,132 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:19,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 18:54:19,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:19,347 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:19,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:19,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1421425359, now seen corresponding path program 6 times [2022-03-15 18:54:19,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:19,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052545138] [2022-03-15 18:54:19,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:19,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:19,554 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:19,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052545138] [2022-03-15 18:54:19,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052545138] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:19,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036519466] [2022-03-15 18:54:19,554 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:54:19,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:19,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:19,555 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-15 18:54:19,556 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-15 18:54:19,617 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 18:54:19,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:19,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 18:54:19,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:20,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:20,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036519466] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:20,607 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:20,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2022-03-15 18:54:20,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1328821367] [2022-03-15 18:54:20,608 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:20,609 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:20,619 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 162 transitions. [2022-03-15 18:54:20,619 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:24,128 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [7110#(and (or (not (= (mod ~g1~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (= (+ (- 1) ~d3~0) 0) (not (= (mod ~g1~0 256) 0))) (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g1~0 256) 0)))), 7112#(and (or (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (= (mod ~g1~0 256) 0))), 7107#(and (or (not (= (mod ~g1~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (not (= (mod ~g1~0 256) 0)) (<= 4 ~pos~0)) (or (<= ~pos~0 4) (not (= (mod ~g1~0 256) 0))) (or (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0) (not (= (mod ~g1~0 256) 0)))), 7106#(and (or (<= 2 ~pos~0) (not (= (mod ~g1~0 256) 0))) (or (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0))) (or (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0) (not (= (mod ~g1~0 256) 0)))), 7113#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~d2~0 1) (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0))), 7105#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g1~0 256) 0)) (< 1 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~g1~0 256) 0)) (<= (+ ~pos~0 2) 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 3))) (or (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)))), 7108#(and (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g1~0 256) 0))) (or (<= 2 ~pos~0) (not (= (mod ~g1~0 256) 0))) (or (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0))) (or (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0) (not (= (mod ~g1~0 256) 0)))), 7109#(and (or (= ~d2~0 1) (not (= (mod ~g1~0 256) 0))) (or (not (= (mod ~g1~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g1~0 256) 0)))), 7114#(and (or (= (mod ~d1~0 256) 0) (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~d2~0 1) (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0))), 7102#(and (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 0) (<= 0 ~pos~0)), 7111#(and (or (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0))), 7104#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 7103#(and (or (not (= 0 (mod ~d3~0 256))) (< 1 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 2) 0)) (<= ~pos~0 2) (< 0 (+ ~pos~0 3)))] [2022-03-15 18:54:24,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 18:54:24,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:24,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 18:54:24,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 18:54:24,129 INFO L87 Difference]: Start difference. First operand 484 states and 1772 transitions. Second operand has 23 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:25,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:25,109 INFO L93 Difference]: Finished difference Result 1735 states and 6093 transitions. [2022-03-15 18:54:25,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:54:25,110 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:54:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:25,120 INFO L225 Difference]: With dead ends: 1735 [2022-03-15 18:54:25,120 INFO L226 Difference]: Without dead ends: 1700 [2022-03-15 18:54:25,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 68 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=448, Invalid=2102, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 18:54:25,122 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 373 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:25,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 0 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:54:25,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2022-03-15 18:54:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 898. [2022-03-15 18:54:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 897 states have (on average 3.981047937569677) internal successors, (3571), 897 states have internal predecessors, (3571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 3571 transitions. [2022-03-15 18:54:25,147 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 3571 transitions. Word has length 22 [2022-03-15 18:54:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:25,147 INFO L470 AbstractCegarLoop]: Abstraction has 898 states and 3571 transitions. [2022-03-15 18:54:25,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:25,147 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 3571 transitions. [2022-03-15 18:54:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:54:25,150 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:25,150 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:25,181 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-15 18:54:25,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:25,382 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1764369387, now seen corresponding path program 7 times [2022-03-15 18:54:25,383 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:25,383 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597439931] [2022-03-15 18:54:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:25,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:25,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:25,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597439931] [2022-03-15 18:54:25,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597439931] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:25,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206883562] [2022-03-15 18:54:25,620 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:54:25,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:25,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:25,622 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-15 18:54:25,635 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-15 18:54:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:25,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:54:25,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:26,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:26,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206883562] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:26,631 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:26,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 23 [2022-03-15 18:54:26,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1206224383] [2022-03-15 18:54:26,633 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:26,640 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:26,650 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 168 transitions. [2022-03-15 18:54:26,650 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:31,103 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10829#(and (= ~d2~0 1) (= ~g2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)))] [2022-03-15 18:54:31,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 18:54:31,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:31,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 18:54:31,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2022-03-15 18:54:31,104 INFO L87 Difference]: Start difference. First operand 898 states and 3571 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:31,293 INFO L93 Difference]: Finished difference Result 1219 states and 4686 transitions. [2022-03-15 18:54:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 18:54:31,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:54:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:31,299 INFO L225 Difference]: With dead ends: 1219 [2022-03-15 18:54:31,300 INFO L226 Difference]: Without dead ends: 1212 [2022-03-15 18:54:31,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 41 SyntacticMatches, 48 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:54:31,300 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:31,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:54:31,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2022-03-15 18:54:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 926. [2022-03-15 18:54:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 925 states have (on average 3.972972972972973) internal successors, (3675), 925 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 3675 transitions. [2022-03-15 18:54:31,351 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 3675 transitions. Word has length 22 [2022-03-15 18:54:31,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:31,351 INFO L470 AbstractCegarLoop]: Abstraction has 926 states and 3675 transitions. [2022-03-15 18:54:31,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 3675 transitions. [2022-03-15 18:54:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:54:31,354 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:31,354 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:31,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 18:54:31,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:31,571 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:31,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:31,571 INFO L85 PathProgramCache]: Analyzing trace with hash -900737689, now seen corresponding path program 8 times [2022-03-15 18:54:31,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:31,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342765609] [2022-03-15 18:54:31,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:31,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:31,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:31,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342765609] [2022-03-15 18:54:31,806 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342765609] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:31,806 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70059849] [2022-03-15 18:54:31,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:54:31,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:31,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:31,807 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:54:31,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 18:54:31,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:54:31,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:31,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:54:31,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:32,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:32,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70059849] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:32,947 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:32,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2022-03-15 18:54:32,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [513194068] [2022-03-15 18:54:32,947 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:32,949 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:32,959 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 172 transitions. [2022-03-15 18:54:32,959 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:37,282 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [14057#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 14058#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 14059#(and (= ~d2~0 1) (= ~g2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)) (= ~g3~0 1))] [2022-03-15 18:54:37,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:54:37,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:37,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:54:37,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2022-03-15 18:54:37,284 INFO L87 Difference]: Start difference. First operand 926 states and 3675 transitions. Second operand has 14 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:38,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:38,000 INFO L93 Difference]: Finished difference Result 1313 states and 4894 transitions. [2022-03-15 18:54:38,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 18:54:38,000 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:54:38,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:38,006 INFO L225 Difference]: With dead ends: 1313 [2022-03-15 18:54:38,006 INFO L226 Difference]: Without dead ends: 1306 [2022-03-15 18:54:38,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 52 SyntacticMatches, 37 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=442, Invalid=1198, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 18:54:38,007 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:38,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:54:38,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2022-03-15 18:54:38,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 956. [2022-03-15 18:54:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 955 states have (on average 3.9539267015706807) internal successors, (3776), 955 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 3776 transitions. [2022-03-15 18:54:38,027 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 3776 transitions. Word has length 22 [2022-03-15 18:54:38,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:38,027 INFO L470 AbstractCegarLoop]: Abstraction has 956 states and 3776 transitions. [2022-03-15 18:54:38,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 3776 transitions. [2022-03-15 18:54:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:54:38,030 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:38,030 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:38,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 18:54:38,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 18:54:38,247 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:38,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:38,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1904824611, now seen corresponding path program 9 times [2022-03-15 18:54:38,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:38,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162764489] [2022-03-15 18:54:38,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:38,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:38,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:38,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162764489] [2022-03-15 18:54:38,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162764489] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:38,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482327861] [2022-03-15 18:54:38,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:54:38,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:38,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:38,437 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:54:38,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 18:54:38,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 18:54:38,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:38,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 18:54:38,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:38,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:39,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482327861] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:39,295 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:39,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 20 [2022-03-15 18:54:39,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [412838068] [2022-03-15 18:54:39,295 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:39,297 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:39,308 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 214 transitions. [2022-03-15 18:54:39,309 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:43,949 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [17457#(and (or (not (= 0 (mod ~d3~0 256))) (< 1 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 2) 0)) (<= ~pos~0 2) (< 0 (+ ~pos~0 3))), 17458#(and (= ~d2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)))] [2022-03-15 18:54:43,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 18:54:43,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:43,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 18:54:43,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2022-03-15 18:54:43,950 INFO L87 Difference]: Start difference. First operand 956 states and 3776 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:44,170 INFO L93 Difference]: Finished difference Result 1155 states and 4380 transitions. [2022-03-15 18:54:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 18:54:44,170 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:54:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:44,175 INFO L225 Difference]: With dead ends: 1155 [2022-03-15 18:54:44,175 INFO L226 Difference]: Without dead ends: 1148 [2022-03-15 18:54:44,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 62 SyntacticMatches, 46 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2022-03-15 18:54:44,176 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:44,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:54:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2022-03-15 18:54:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1008. [2022-03-15 18:54:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1007 states have (on average 3.9662363455809335) internal successors, (3994), 1007 states have internal predecessors, (3994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:44,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 3994 transitions. [2022-03-15 18:54:44,197 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 3994 transitions. Word has length 22 [2022-03-15 18:54:44,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:44,197 INFO L470 AbstractCegarLoop]: Abstraction has 1008 states and 3994 transitions. [2022-03-15 18:54:44,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:44,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 3994 transitions. [2022-03-15 18:54:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:54:44,200 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:44,200 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:44,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 18:54:44,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:44,417 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:44,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:44,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1011450401, now seen corresponding path program 10 times [2022-03-15 18:54:44,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:44,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810089250] [2022-03-15 18:54:44,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:44,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:44,643 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:44,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:44,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810089250] [2022-03-15 18:54:44,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810089250] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:44,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79812152] [2022-03-15 18:54:44,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:54:44,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:44,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:44,652 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:54:44,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 18:54:44,712 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:54:44,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:44,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:54:44,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:45,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:45,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79812152] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:45,735 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:45,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2022-03-15 18:54:45,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1119562486] [2022-03-15 18:54:45,735 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:45,737 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:45,745 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 147 transitions. [2022-03-15 18:54:45,746 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:48,173 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [20783#(and (or (not (= (mod ~g1~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g1~0 256) 0)))), 20788#(and (or (<= 2 ~pos~0) (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)))), 20791#(and (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~d1~0 256) 0)) (= (+ (- 1) ~d2~0) 0) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0)))), 20792#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 3) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= (+ (- 1) ~d2~0) 0) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0))), 20790#(and (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (+ (- 1) ~d2~0) 0) (= (mod ~g1~0 256) 0))), 20796#(and (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= (+ ~pos~0 1) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~g1~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (= (+ (- 1) ~d2~0) 0) (= (mod ~g1~0 256) 0))), 20781#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 20795#(and (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~g1~0 256) 0) (= ~g3~0 1)) (or (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0)) (or (= ~g3~0 ~g1~0) (= (mod ~g1~0 256) 0))), 20786#(and (or (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g3~0 256) 0)))), 20789#(and (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0))), 20784#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 20793#(and (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (= (+ (- 1) ~d2~0) 0) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0))), 20794#(and (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (= (+ (- 1) ~d2~0) 0) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0))), 20782#(and (or (not (= (mod ~g1~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (<= 2 ~pos~0) (not (= (mod ~g1~0 256) 0))) (or (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)))), 20787#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 20785#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))))] [2022-03-15 18:54:48,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 18:54:48,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:48,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 18:54:48,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1353, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 18:54:48,174 INFO L87 Difference]: Start difference. First operand 1008 states and 3994 transitions. Second operand has 26 states, 25 states have (on average 3.48) internal successors, (87), 25 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:53,820 INFO L93 Difference]: Finished difference Result 2248 states and 8466 transitions. [2022-03-15 18:54:53,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-03-15 18:54:53,820 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.48) internal successors, (87), 25 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:54:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:53,830 INFO L225 Difference]: With dead ends: 2248 [2022-03-15 18:54:53,830 INFO L226 Difference]: Without dead ends: 2234 [2022-03-15 18:54:53,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4602 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2299, Invalid=11507, Unknown=0, NotChecked=0, Total=13806 [2022-03-15 18:54:53,833 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 752 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:53,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [752 Valid, 0 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 18:54:53,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2022-03-15 18:54:53,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 1418. [2022-03-15 18:54:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1417 states have (on average 4.1171489061397315) internal successors, (5834), 1417 states have internal predecessors, (5834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:53,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 5834 transitions. [2022-03-15 18:54:53,867 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 5834 transitions. Word has length 22 [2022-03-15 18:54:53,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:53,867 INFO L470 AbstractCegarLoop]: Abstraction has 1418 states and 5834 transitions. [2022-03-15 18:54:53,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.48) internal successors, (87), 25 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 5834 transitions. [2022-03-15 18:54:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:54:53,870 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:53,870 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:53,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 18:54:54,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 18:54:54,087 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:54,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:54,087 INFO L85 PathProgramCache]: Analyzing trace with hash 490683051, now seen corresponding path program 11 times [2022-03-15 18:54:54,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:54,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749910249] [2022-03-15 18:54:54,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:54,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:54:54,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:54,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749910249] [2022-03-15 18:54:54,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749910249] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:54,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935394227] [2022-03-15 18:54:54,299 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:54:54,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:54,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:54,316 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:54:54,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 18:54:54,385 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 18:54:54,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:54,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:54:54,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:54,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:55,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935394227] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:55,408 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:55,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2022-03-15 18:54:55,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2104715198] [2022-03-15 18:54:55,408 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:55,410 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:55,417 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 125 transitions. [2022-03-15 18:54:55,417 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:54:56,704 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [26184#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 0) (<= 0 ~pos~0))] [2022-03-15 18:54:56,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:54:56,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:54:56,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:54:56,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2022-03-15 18:54:56,705 INFO L87 Difference]: Start difference. First operand 1418 states and 5834 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:56,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:54:56,956 INFO L93 Difference]: Finished difference Result 1972 states and 7612 transitions. [2022-03-15 18:54:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 18:54:56,956 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:54:56,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:54:56,965 INFO L225 Difference]: With dead ends: 1972 [2022-03-15 18:54:56,965 INFO L226 Difference]: Without dead ends: 1958 [2022-03-15 18:54:56,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 53 SyntacticMatches, 17 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2022-03-15 18:54:56,966 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:54:56,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:54:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2022-03-15 18:54:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1552. [2022-03-15 18:54:56,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1551 states have (on average 4.145712443584784) internal successors, (6430), 1551 states have internal predecessors, (6430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 6430 transitions. [2022-03-15 18:54:56,996 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 6430 transitions. Word has length 22 [2022-03-15 18:54:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:54:56,997 INFO L470 AbstractCegarLoop]: Abstraction has 1552 states and 6430 transitions. [2022-03-15 18:54:56,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:54:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 6430 transitions. [2022-03-15 18:54:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:54:57,000 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:54:57,000 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:54:57,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 18:54:57,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 18:54:57,207 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:54:57,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:54:57,208 INFO L85 PathProgramCache]: Analyzing trace with hash 587139165, now seen corresponding path program 12 times [2022-03-15 18:54:57,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:54:57,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121886385] [2022-03-15 18:54:57,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:54:57,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:54:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:54:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:57,414 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:54:57,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121886385] [2022-03-15 18:54:57,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121886385] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:54:57,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55358354] [2022-03-15 18:54:57,415 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:54:57,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:54:57,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:54:57,436 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:54:57,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 18:54:57,516 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 18:54:57,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:54:57,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:54:57,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:54:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:57,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:54:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:54:58,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55358354] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:54:58,567 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:54:58,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2022-03-15 18:54:58,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [465096153] [2022-03-15 18:54:58,587 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:54:58,589 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:54:58,597 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 151 transitions. [2022-03-15 18:54:58,597 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:01,727 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [31424#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 31416#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 31420#(and (or (not (= 0 (mod ~d3~0 256))) (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (mod ~g3~0 256) 0))), 31417#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 31422#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0))), 31418#(and (or (= ~g2~0 1) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)))), 31421#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0))), 31423#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0))), 31419#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g3~0 256) 0))))] [2022-03-15 18:55:01,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 18:55:01,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:01,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 18:55:01,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1106, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 18:55:01,728 INFO L87 Difference]: Start difference. First operand 1552 states and 6430 transitions. Second operand has 20 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:03,388 INFO L93 Difference]: Finished difference Result 1977 states and 7591 transitions. [2022-03-15 18:55:03,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 18:55:03,389 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:55:03,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:03,408 INFO L225 Difference]: With dead ends: 1977 [2022-03-15 18:55:03,408 INFO L226 Difference]: Without dead ends: 1936 [2022-03-15 18:55:03,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 54 SyntacticMatches, 14 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=734, Invalid=3048, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 18:55:03,411 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 312 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:03,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 0 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:55:03,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2022-03-15 18:55:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 982. [2022-03-15 18:55:03,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 3.9184505606523956) internal successors, (3844), 981 states have internal predecessors, (3844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 3844 transitions. [2022-03-15 18:55:03,435 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 3844 transitions. Word has length 22 [2022-03-15 18:55:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:03,435 INFO L470 AbstractCegarLoop]: Abstraction has 982 states and 3844 transitions. [2022-03-15 18:55:03,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 3844 transitions. [2022-03-15 18:55:03,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:55:03,437 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:03,437 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:55:03,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 18:55:03,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 18:55:03,663 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:03,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:03,664 INFO L85 PathProgramCache]: Analyzing trace with hash -146164213, now seen corresponding path program 13 times [2022-03-15 18:55:03,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:03,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467913231] [2022-03-15 18:55:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:03,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:03,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:03,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467913231] [2022-03-15 18:55:03,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467913231] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:55:03,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025052419] [2022-03-15 18:55:03,913 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:55:03,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:03,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:55:03,914 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:55:03,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 18:55:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:04,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:55:04,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:55:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:04,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:55:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:05,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025052419] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:55:05,215 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:55:05,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 18:55:05,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1767380920] [2022-03-15 18:55:05,216 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:05,217 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:05,225 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 133 transitions. [2022-03-15 18:55:05,226 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:07,974 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [35570#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (<= 5 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 5) (= (mod ~g3~0 256) 0))), 35572#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 35569#(and (= ~d2~0 1) (= ~g2~0 1) (or (not (= (mod ~d1~0 256) 0)) (= ~g3~0 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (= ~g3~0 0)) (or (not (= (* (div ~d3~0 256) 256) ~d3~0)) (not (= ~g3~0 0))) (or (<= ~pos~0 3) (= ~g3~0 0)) (or (= ~g3~0 1) (= ~g3~0 0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= ~g3~0 0))), 35571#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 35567#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 35568#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:55:07,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:55:07,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:07,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:55:07,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 18:55:07,975 INFO L87 Difference]: Start difference. First operand 982 states and 3844 transitions. Second operand has 17 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:09,021 INFO L93 Difference]: Finished difference Result 1305 states and 4943 transitions. [2022-03-15 18:55:09,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 18:55:09,021 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:55:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:09,025 INFO L225 Difference]: With dead ends: 1305 [2022-03-15 18:55:09,025 INFO L226 Difference]: Without dead ends: 1298 [2022-03-15 18:55:09,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 19 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=430, Invalid=1922, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 18:55:09,026 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:09,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:55:09,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2022-03-15 18:55:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 988. [2022-03-15 18:55:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 3.921985815602837) internal successors, (3871), 987 states have internal predecessors, (3871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 3871 transitions. [2022-03-15 18:55:09,046 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 3871 transitions. Word has length 22 [2022-03-15 18:55:09,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:09,046 INFO L470 AbstractCegarLoop]: Abstraction has 988 states and 3871 transitions. [2022-03-15 18:55:09,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 3871 transitions. [2022-03-15 18:55:09,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:55:09,049 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:09,049 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:55:09,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 18:55:09,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 18:55:09,263 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:09,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:09,263 INFO L85 PathProgramCache]: Analyzing trace with hash 717467485, now seen corresponding path program 14 times [2022-03-15 18:55:09,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:09,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361168558] [2022-03-15 18:55:09,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:09,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:09,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:09,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361168558] [2022-03-15 18:55:09,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361168558] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:55:09,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590349146] [2022-03-15 18:55:09,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:55:09,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:09,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:55:09,504 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:55:09,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 18:55:09,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:55:09,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:55:09,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 18:55:09,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:55:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:09,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:55:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:10,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590349146] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:55:10,707 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:55:10,707 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 18:55:10,707 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1057301940] [2022-03-15 18:55:10,707 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:10,709 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:10,717 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 137 transitions. [2022-03-15 18:55:10,717 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:13,245 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [39040#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 39039#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0))), 39038#(and (= ~d2~0 1) (<= 1 ~pos~0) (<= ~pos~0 3) (or (not (= (mod ~d1~0 256) 0)) (<= 3 ~pos~0)) (= ~g3~0 1) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1))), 39037#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 39041#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 39036#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:55:13,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:55:13,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:13,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:55:13,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:55:13,247 INFO L87 Difference]: Start difference. First operand 988 states and 3871 transitions. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:13,558 INFO L93 Difference]: Finished difference Result 1225 states and 4679 transitions. [2022-03-15 18:55:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 18:55:13,559 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:55:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:13,562 INFO L225 Difference]: With dead ends: 1225 [2022-03-15 18:55:13,562 INFO L226 Difference]: Without dead ends: 1218 [2022-03-15 18:55:13,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 56 SyntacticMatches, 15 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 18:55:13,563 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:13,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:55:13,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2022-03-15 18:55:13,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1034. [2022-03-15 18:55:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 3.930300096805421) internal successors, (4060), 1033 states have internal predecessors, (4060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 4060 transitions. [2022-03-15 18:55:13,581 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 4060 transitions. Word has length 22 [2022-03-15 18:55:13,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:13,582 INFO L470 AbstractCegarLoop]: Abstraction has 1034 states and 4060 transitions. [2022-03-15 18:55:13,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:13,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 4060 transitions. [2022-03-15 18:55:13,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:55:13,584 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:13,584 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:55:13,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 18:55:13,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:13,800 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:13,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:13,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1203025023, now seen corresponding path program 15 times [2022-03-15 18:55:13,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:13,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31215356] [2022-03-15 18:55:13,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:13,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:14,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:14,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31215356] [2022-03-15 18:55:14,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31215356] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:55:14,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027983072] [2022-03-15 18:55:14,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:55:14,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:14,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:55:14,170 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:55:14,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 18:55:14,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 18:55:14,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:55:14,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:55:14,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:55:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:14,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:55:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:15,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027983072] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:55:15,366 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:55:15,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 18:55:15,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [773868787] [2022-03-15 18:55:15,367 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:15,369 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:15,376 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 120 transitions. [2022-03-15 18:55:15,376 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:17,659 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [42498#(and (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 42495#(and (or (<= 2 ~pos~0) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 2) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)) (<= (+ ~pos~0 2) 0) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (= ~g2~0 0) (<= 0 (+ ~pos~0 2)) (not (= (mod ~g3~0 256) 0)))), 42494#(and (or (= ~g2~0 0) (<= (+ ~pos~0 1) 0) (= (* (div ~d2~0 256) 256) ~d2~0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (not (= (mod ~d1~0 256) 0)) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (<= 3 ~pos~0)) (or (<= ~pos~0 3) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 0) (<= 0 (+ ~pos~0 1))) (or (= (mod ~d1~0 256) 0) (= ~g2~0 0) (<= (+ ~pos~0 3) 0) (= (* (div ~d2~0 256) 256) ~d2~0)) (or (<= 1 ~pos~0) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (= ~g2~0 0) (<= 0 (+ ~pos~0 3)))), 42496#(and (or (not (= 0 (mod ~d3~0 256))) (<= 5 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 5) (= (mod ~g3~0 256) 0))), 42497#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 42493#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:55:17,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:55:17,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:17,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:55:17,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2022-03-15 18:55:17,660 INFO L87 Difference]: Start difference. First operand 1034 states and 4060 transitions. Second operand has 16 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:19,273 INFO L93 Difference]: Finished difference Result 1659 states and 6077 transitions. [2022-03-15 18:55:19,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 18:55:19,273 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:55:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:19,278 INFO L225 Difference]: With dead ends: 1659 [2022-03-15 18:55:19,278 INFO L226 Difference]: Without dead ends: 1652 [2022-03-15 18:55:19,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=300, Invalid=1592, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 18:55:19,279 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 219 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:19,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 0 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1363 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 18:55:19,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2022-03-15 18:55:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1080. [2022-03-15 18:55:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1079 states have (on average 3.9731232622798887) internal successors, (4287), 1079 states have internal predecessors, (4287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 4287 transitions. [2022-03-15 18:55:19,318 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 4287 transitions. Word has length 22 [2022-03-15 18:55:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:19,318 INFO L470 AbstractCegarLoop]: Abstraction has 1080 states and 4287 transitions. [2022-03-15 18:55:19,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 4287 transitions. [2022-03-15 18:55:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:55:19,320 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:19,320 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:55:19,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 18:55:19,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 18:55:19,544 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:19,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2118048285, now seen corresponding path program 16 times [2022-03-15 18:55:19,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:19,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364585008] [2022-03-15 18:55:19,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:19,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:19,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:19,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364585008] [2022-03-15 18:55:19,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364585008] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:55:19,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075452031] [2022-03-15 18:55:19,877 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:55:19,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:19,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:55:19,878 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:55:19,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 18:55:19,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:55:19,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:55:19,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 18:55:19,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:55:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:20,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:55:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:21,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075452031] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:55:21,289 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:55:21,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2022-03-15 18:55:21,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1955418346] [2022-03-15 18:55:21,289 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:21,291 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:21,297 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 110 transitions. [2022-03-15 18:55:21,297 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:22,917 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [46497#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 46501#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 46498#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 46499#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 46503#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 46445#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 46500#(and (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 46502#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 46496#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0)))] [2022-03-15 18:55:22,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 18:55:22,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:22,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 18:55:22,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1012, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 18:55:22,935 INFO L87 Difference]: Start difference. First operand 1080 states and 4287 transitions. Second operand has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:23,929 INFO L93 Difference]: Finished difference Result 1417 states and 5312 transitions. [2022-03-15 18:55:23,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 18:55:23,930 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:55:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:23,933 INFO L225 Difference]: With dead ends: 1417 [2022-03-15 18:55:23,933 INFO L226 Difference]: Without dead ends: 1410 [2022-03-15 18:55:23,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=482, Invalid=2274, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 18:55:23,935 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 233 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:23,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 0 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:55:23,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2022-03-15 18:55:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1116. [2022-03-15 18:55:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 3.995515695067265) internal successors, (4455), 1115 states have internal predecessors, (4455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 4455 transitions. [2022-03-15 18:55:23,989 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 4455 transitions. Word has length 22 [2022-03-15 18:55:23,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:23,989 INFO L470 AbstractCegarLoop]: Abstraction has 1116 states and 4455 transitions. [2022-03-15 18:55:23,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 4455 transitions. [2022-03-15 18:55:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:55:23,992 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:23,992 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:55:24,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 18:55:24,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:24,208 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:24,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:24,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1645924163, now seen corresponding path program 17 times [2022-03-15 18:55:24,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:24,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301729279] [2022-03-15 18:55:24,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:24,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:24,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:24,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301729279] [2022-03-15 18:55:24,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301729279] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:55:24,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938651388] [2022-03-15 18:55:24,468 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:55:24,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:24,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:55:24,469 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:55:24,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 18:55:24,575 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 18:55:24,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:55:24,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 18:55:24,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:55:24,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:24,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:55:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:25,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938651388] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:55:25,584 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:55:25,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 18:55:25,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1489409492] [2022-03-15 18:55:25,584 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:25,586 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:25,593 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 124 transitions. [2022-03-15 18:55:25,593 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:27,613 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [50344#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 50342#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~d1~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 50341#(and (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 4) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0))), 50343#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0))), 50339#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 50340#(and (or (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (<= 2 ~pos~0) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 2) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))))] [2022-03-15 18:55:27,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:55:27,613 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:27,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:55:27,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2022-03-15 18:55:27,614 INFO L87 Difference]: Start difference. First operand 1116 states and 4455 transitions. Second operand has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:29,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:29,889 INFO L93 Difference]: Finished difference Result 2581 states and 9499 transitions. [2022-03-15 18:55:29,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 18:55:29,889 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:55:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:29,896 INFO L225 Difference]: With dead ends: 2581 [2022-03-15 18:55:29,896 INFO L226 Difference]: Without dead ends: 2574 [2022-03-15 18:55:29,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 53 SyntacticMatches, 10 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=802, Invalid=3488, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 18:55:29,898 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 383 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:29,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 0 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 18:55:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2022-03-15 18:55:29,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1136. [2022-03-15 18:55:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 1135 states have (on average 3.9894273127753306) internal successors, (4528), 1135 states have internal predecessors, (4528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 4528 transitions. [2022-03-15 18:55:29,928 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 4528 transitions. Word has length 22 [2022-03-15 18:55:29,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:29,928 INFO L470 AbstractCegarLoop]: Abstraction has 1136 states and 4528 transitions. [2022-03-15 18:55:29,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 4528 transitions. [2022-03-15 18:55:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:55:29,930 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:29,930 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:55:29,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 18:55:30,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:30,147 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:30,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:30,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1290624637, now seen corresponding path program 18 times [2022-03-15 18:55:30,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:30,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617367011] [2022-03-15 18:55:30,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:30,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:30,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:30,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617367011] [2022-03-15 18:55:30,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617367011] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:55:30,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401933535] [2022-03-15 18:55:30,418 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:55:30,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:30,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:55:30,419 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:55:30,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 18:55:30,488 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 18:55:30,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:55:30,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 18:55:30,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:55:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:30,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:55:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:31,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401933535] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:55:31,833 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:55:31,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-03-15 18:55:31,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [463610387] [2022-03-15 18:55:31,833 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:31,835 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:31,842 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 128 transitions. [2022-03-15 18:55:31,843 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:34,282 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [55417#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 55418#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 55416#(and (= ~d2~0 1) (= ~g2~0 1) (<= ~pos~0 1) (<= 1 ~pos~0) (< 0 (+ (div ~d1~0 256) 1)) (<= ~d1~0 (* 256 (div ~d1~0 256)))), 55415#(and (or (not (= 0 (mod ~d3~0 256))) (< 1 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 2) 0)) (<= ~pos~0 2) (< 0 (+ ~pos~0 3)))] [2022-03-15 18:55:34,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:55:34,282 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:34,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:55:34,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2022-03-15 18:55:34,283 INFO L87 Difference]: Start difference. First operand 1136 states and 4528 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:34,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:34,692 INFO L93 Difference]: Finished difference Result 1345 states and 5231 transitions. [2022-03-15 18:55:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 18:55:34,693 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:55:34,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:34,696 INFO L225 Difference]: With dead ends: 1345 [2022-03-15 18:55:34,696 INFO L226 Difference]: Without dead ends: 1326 [2022-03-15 18:55:34,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 48 SyntacticMatches, 22 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2022-03-15 18:55:34,697 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:34,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:55:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2022-03-15 18:55:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1146. [2022-03-15 18:55:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 3.993013100436681) internal successors, (4572), 1145 states have internal predecessors, (4572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:34,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 4572 transitions. [2022-03-15 18:55:34,716 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 4572 transitions. Word has length 22 [2022-03-15 18:55:34,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:34,717 INFO L470 AbstractCegarLoop]: Abstraction has 1146 states and 4572 transitions. [2022-03-15 18:55:34,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 4572 transitions. [2022-03-15 18:55:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:55:34,720 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:34,720 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:55:34,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 18:55:34,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:34,935 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:34,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:34,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1750439645, now seen corresponding path program 19 times [2022-03-15 18:55:34,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:34,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678620930] [2022-03-15 18:55:34,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:34,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:35,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:35,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678620930] [2022-03-15 18:55:35,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678620930] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:55:35,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175901564] [2022-03-15 18:55:35,135 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:55:35,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:35,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:55:35,136 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:55:35,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 18:55:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:35,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:55:35,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:55:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:35,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:55:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:36,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175901564] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:55:36,375 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:55:36,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 21 [2022-03-15 18:55:36,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1525317935] [2022-03-15 18:55:36,375 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:36,377 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:36,384 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 124 transitions. [2022-03-15 18:55:36,384 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:38,554 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [59218#(and (or (not (= 0 (mod ~d3~0 256))) (< 1 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 2) 0)) (<= ~pos~0 2) (< 0 (+ ~pos~0 3))), 59219#(and (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 1) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 3) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0)) (<= ~pos~0 3) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1)) (< 0 (+ ~pos~0 4))), 59215#(and (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 1) (<= 1 ~pos~0) (= ~d1~0 0)), 59217#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 59216#(and (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 0) (<= 0 ~pos~0))] [2022-03-15 18:55:38,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:55:38,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:38,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:55:38,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:55:38,556 INFO L87 Difference]: Start difference. First operand 1146 states and 4572 transitions. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:38,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:38,826 INFO L93 Difference]: Finished difference Result 1426 states and 5421 transitions. [2022-03-15 18:55:38,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 18:55:38,826 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:55:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:38,830 INFO L225 Difference]: With dead ends: 1426 [2022-03-15 18:55:38,830 INFO L226 Difference]: Without dead ends: 1382 [2022-03-15 18:55:38,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:55:38,830 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:38,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:55:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2022-03-15 18:55:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1160. [2022-03-15 18:55:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1159 states have (on average 3.985332182916307) internal successors, (4619), 1159 states have internal predecessors, (4619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 4619 transitions. [2022-03-15 18:55:38,876 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 4619 transitions. Word has length 22 [2022-03-15 18:55:38,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:38,876 INFO L470 AbstractCegarLoop]: Abstraction has 1160 states and 4619 transitions. [2022-03-15 18:55:38,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 4619 transitions. [2022-03-15 18:55:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:55:38,879 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:38,879 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:55:38,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 18:55:39,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:39,095 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:39,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:39,097 INFO L85 PathProgramCache]: Analyzing trace with hash 32501049, now seen corresponding path program 20 times [2022-03-15 18:55:39,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:39,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069739441] [2022-03-15 18:55:39,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:39,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:39,349 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:39,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069739441] [2022-03-15 18:55:39,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069739441] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:55:39,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50081238] [2022-03-15 18:55:39,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:55:39,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:39,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:55:39,359 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:55:39,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 18:55:39,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:55:39,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:55:39,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 18:55:39,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:55:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:39,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:55:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:40,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50081238] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:55:40,670 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:55:40,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 18:55:40,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1062912510] [2022-03-15 18:55:40,670 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:40,672 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:40,679 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 124 transitions. [2022-03-15 18:55:40,679 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:42,354 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [63121#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0)))), 63117#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 63122#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 63118#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 2 ~pos~0) (= (mod ~g1~0 256) 0)) (or (<= ~pos~0 2) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~g1~0 256) 0) (= ~g3~0 1)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0))), 63119#(and (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (= (mod ~g1~0 256) 0) (<= (div ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g1~0 256) 0) (<= (div ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g1~0 256) 0) (<= 1 ~g1~0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 3) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (= (* (div ~d2~0 256) 256) ~d2~0)) (or (<= 1 ~pos~0) (= (mod ~g1~0 256) 0) (<= 1 ~g1~0))), 63120#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:55:42,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:55:42,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:42,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:55:42,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:55:42,355 INFO L87 Difference]: Start difference. First operand 1160 states and 4619 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:44,498 INFO L93 Difference]: Finished difference Result 1835 states and 6788 transitions. [2022-03-15 18:55:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 18:55:44,498 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:55:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:44,502 INFO L225 Difference]: With dead ends: 1835 [2022-03-15 18:55:44,502 INFO L226 Difference]: Without dead ends: 1828 [2022-03-15 18:55:44,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 55 SyntacticMatches, 10 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=718, Invalid=3838, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 18:55:44,503 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 395 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:44,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 0 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:55:44,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2022-03-15 18:55:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1178. [2022-03-15 18:55:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 3.9932030586236196) internal successors, (4700), 1177 states have internal predecessors, (4700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 4700 transitions. [2022-03-15 18:55:44,524 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 4700 transitions. Word has length 22 [2022-03-15 18:55:44,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:44,524 INFO L470 AbstractCegarLoop]: Abstraction has 1178 states and 4700 transitions. [2022-03-15 18:55:44,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 4700 transitions. [2022-03-15 18:55:44,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:55:44,527 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:44,527 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:55:44,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 18:55:44,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 18:55:44,732 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash -941392939, now seen corresponding path program 21 times [2022-03-15 18:55:44,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:44,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008199338] [2022-03-15 18:55:44,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:44,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:44,993 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:44,993 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008199338] [2022-03-15 18:55:44,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008199338] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:55:44,993 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237493865] [2022-03-15 18:55:44,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:55:44,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:44,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:55:44,994 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:55:44,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 18:55:45,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 18:55:45,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:55:45,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:55:45,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:55:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:45,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:55:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:45,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237493865] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:55:45,925 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:55:45,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 18:55:45,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [184401745] [2022-03-15 18:55:45,925 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:45,927 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:45,934 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 114 transitions. [2022-03-15 18:55:45,934 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:46,861 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [67543#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 67542#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 67541#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 67540#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 67544#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0))] [2022-03-15 18:55:46,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:55:46,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:46,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:55:46,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:55:46,862 INFO L87 Difference]: Start difference. First operand 1178 states and 4700 transitions. Second operand has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:47,139 INFO L93 Difference]: Finished difference Result 1423 states and 5402 transitions. [2022-03-15 18:55:47,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 18:55:47,139 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:55:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:47,142 INFO L225 Difference]: With dead ends: 1423 [2022-03-15 18:55:47,142 INFO L226 Difference]: Without dead ends: 1416 [2022-03-15 18:55:47,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2022-03-15 18:55:47,145 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 138 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:47,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 0 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:55:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2022-03-15 18:55:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1178. [2022-03-15 18:55:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 3.9932030586236196) internal successors, (4700), 1177 states have internal predecessors, (4700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 4700 transitions. [2022-03-15 18:55:47,172 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 4700 transitions. Word has length 22 [2022-03-15 18:55:47,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:47,173 INFO L470 AbstractCegarLoop]: Abstraction has 1178 states and 4700 transitions. [2022-03-15 18:55:47,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 4700 transitions. [2022-03-15 18:55:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:55:47,175 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:47,175 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:55:47,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 18:55:47,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 18:55:47,380 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:47,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:47,380 INFO L85 PathProgramCache]: Analyzing trace with hash -410398091, now seen corresponding path program 22 times [2022-03-15 18:55:47,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:47,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790112553] [2022-03-15 18:55:47,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:47,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:47,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:47,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790112553] [2022-03-15 18:55:47,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790112553] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:55:47,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106361720] [2022-03-15 18:55:47,602 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:55:47,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:47,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:55:47,603 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:55:47,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 18:55:47,674 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:55:47,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:55:47,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 18:55:47,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:55:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:47,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:55:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:48,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106361720] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:55:48,718 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:55:48,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 18:55:48,718 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2079905261] [2022-03-15 18:55:48,718 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:48,720 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:48,728 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 128 transitions. [2022-03-15 18:55:48,728 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:49,971 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [71481#(and (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 4) (= (mod ~g3~0 256) 0))), 71478#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 71477#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 71480#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0)))), 71479#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0))] [2022-03-15 18:55:49,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:55:49,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:49,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:55:49,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:55:49,973 INFO L87 Difference]: Start difference. First operand 1178 states and 4700 transitions. Second operand has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:50,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:50,594 INFO L93 Difference]: Finished difference Result 1837 states and 6824 transitions. [2022-03-15 18:55:50,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 18:55:50,594 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:55:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:50,598 INFO L225 Difference]: With dead ends: 1837 [2022-03-15 18:55:50,598 INFO L226 Difference]: Without dead ends: 1830 [2022-03-15 18:55:50,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 59 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=394, Invalid=1586, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 18:55:50,598 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:50,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:55:50,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2022-03-15 18:55:50,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1194. [2022-03-15 18:55:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1193 states have (on average 3.9882648784576697) internal successors, (4758), 1193 states have internal predecessors, (4758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 4758 transitions. [2022-03-15 18:55:50,618 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 4758 transitions. Word has length 22 [2022-03-15 18:55:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:50,618 INFO L470 AbstractCegarLoop]: Abstraction has 1194 states and 4758 transitions. [2022-03-15 18:55:50,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:50,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 4758 transitions. [2022-03-15 18:55:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:55:50,621 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:50,621 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:55:50,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 18:55:50,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:50,837 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:50,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:50,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1768816587, now seen corresponding path program 23 times [2022-03-15 18:55:50,838 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:50,838 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419950667] [2022-03-15 18:55:50,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:50,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:51,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:51,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419950667] [2022-03-15 18:55:51,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419950667] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:55:51,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004087774] [2022-03-15 18:55:51,077 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:55:51,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:51,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:55:51,078 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:55:51,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 18:55:51,152 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 18:55:51,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:55:51,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 18:55:51,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:55:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:51,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:55:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:52,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004087774] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:55:52,277 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:55:52,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2022-03-15 18:55:52,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1672042116] [2022-03-15 18:55:52,277 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:52,279 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:52,287 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 132 transitions. [2022-03-15 18:55:52,287 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:55:54,853 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [75899#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0) (= ~g3~0 1)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1) (< 0 (+ ~pos~0 1)))), 75895#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 75893#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 75898#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 75897#(and (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~g1~0 256) 0) (= ~g3~0 1)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0))), 75896#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0))), 75892#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 75900#(and (or (= ~g2~0 1) (<= 2 ~pos~0) (not (= (mod ~g1~0 256) 0))) (or (= ~g2~0 1) (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0))) (or (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1))), 75894#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:55:54,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 18:55:54,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:55:54,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 18:55:54,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1093, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 18:55:54,855 INFO L87 Difference]: Start difference. First operand 1194 states and 4758 transitions. Second operand has 21 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:55:57,793 INFO L93 Difference]: Finished difference Result 2264 states and 8083 transitions. [2022-03-15 18:55:57,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 18:55:57,794 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:55:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:55:57,798 INFO L225 Difference]: With dead ends: 2264 [2022-03-15 18:55:57,798 INFO L226 Difference]: Without dead ends: 2250 [2022-03-15 18:55:57,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 45 SyntacticMatches, 18 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2596 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1500, Invalid=5472, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 18:55:57,799 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 402 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:55:57,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 0 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:55:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2022-03-15 18:55:57,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 1202. [2022-03-15 18:55:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 1201 states have (on average 3.987510407993339) internal successors, (4789), 1201 states have internal predecessors, (4789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 4789 transitions. [2022-03-15 18:55:57,823 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 4789 transitions. Word has length 22 [2022-03-15 18:55:57,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:55:57,823 INFO L470 AbstractCegarLoop]: Abstraction has 1202 states and 4789 transitions. [2022-03-15 18:55:57,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:55:57,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 4789 transitions. [2022-03-15 18:55:57,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:55:57,826 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:55:57,826 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:55:57,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 18:55:58,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:58,043 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:55:58,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:55:58,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1891874129, now seen corresponding path program 24 times [2022-03-15 18:55:58,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:55:58,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357142869] [2022-03-15 18:55:58,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:55:58,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:55:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:55:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:58,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:55:58,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357142869] [2022-03-15 18:55:58,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357142869] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:55:58,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007382690] [2022-03-15 18:55:58,284 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:55:58,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:55:58,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:55:58,300 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:55:58,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 18:55:58,385 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 18:55:58,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:55:58,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 18:55:58,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:55:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:58,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:55:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:55:59,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007382690] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:55:59,438 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:55:59,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 18:55:59,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [385837862] [2022-03-15 18:55:59,439 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:55:59,440 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:55:59,447 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 114 transitions. [2022-03-15 18:55:59,448 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:00,593 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [80817#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 80815#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 80813#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 80814#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 80816#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)))] [2022-03-15 18:56:00,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:56:00,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:00,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:56:00,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:56:00,594 INFO L87 Difference]: Start difference. First operand 1202 states and 4789 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:01,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:01,125 INFO L93 Difference]: Finished difference Result 1815 states and 6700 transitions. [2022-03-15 18:56:01,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 18:56:01,126 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:56:01,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:01,129 INFO L225 Difference]: With dead ends: 1815 [2022-03-15 18:56:01,129 INFO L226 Difference]: Without dead ends: 1808 [2022-03-15 18:56:01,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 18:56:01,130 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:01,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:56:01,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-03-15 18:56:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1210. [2022-03-15 18:56:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1209 states have (on average 3.9875930521091814) internal successors, (4821), 1209 states have internal predecessors, (4821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4821 transitions. [2022-03-15 18:56:01,151 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4821 transitions. Word has length 22 [2022-03-15 18:56:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:01,151 INFO L470 AbstractCegarLoop]: Abstraction has 1210 states and 4821 transitions. [2022-03-15 18:56:01,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4821 transitions. [2022-03-15 18:56:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:56:01,154 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:01,154 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:01,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:01,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 18:56:01,361 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:01,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:01,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1309001579, now seen corresponding path program 25 times [2022-03-15 18:56:01,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:01,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626928378] [2022-03-15 18:56:01,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:01,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:01,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:01,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626928378] [2022-03-15 18:56:01,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626928378] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:01,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281611592] [2022-03-15 18:56:01,597 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:56:01,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:01,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:01,612 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:01,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 18:56:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:01,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:56:01,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:02,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:02,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281611592] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:02,792 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:02,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 18:56:02,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2142046957] [2022-03-15 18:56:02,792 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:02,794 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:02,801 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 128 transitions. [2022-03-15 18:56:02,802 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:04,808 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [85229#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (< 0 (+ ~pos~0 1))), 85225#(and (or (not (= 0 (mod ~d3~0 256))) (< 1 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 2) 0)) (<= ~pos~0 2) (< 0 (+ ~pos~0 3))), 85228#(and (or (= ~g2~0 1) (<= ~pos~0 2)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (<= (+ ~pos~0 2) 0)) (or (= ~g2~0 1) (< 0 (+ ~pos~0 3))) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (< 1 ~pos~0))), 85226#(and (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 1) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 3) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0)) (<= ~pos~0 3) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1)) (< 0 (+ ~pos~0 4))), 85175#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 85227#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g2~0 256) 0)) (< 1 ~pos~0)) (or (not (= (mod ~g2~0 256) 0)) (<= ~pos~0 2)) (or (not (= (mod ~g2~0 256) 0)) (< 0 (+ ~pos~0 3))) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~g2~0 256) 0)) (<= (+ ~pos~0 2) 0)))] [2022-03-15 18:56:04,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:56:04,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:04,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:56:04,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:56:04,809 INFO L87 Difference]: Start difference. First operand 1210 states and 4821 transitions. Second operand has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:05,278 INFO L93 Difference]: Finished difference Result 1423 states and 5551 transitions. [2022-03-15 18:56:05,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 18:56:05,278 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:56:05,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:05,281 INFO L225 Difference]: With dead ends: 1423 [2022-03-15 18:56:05,281 INFO L226 Difference]: Without dead ends: 1398 [2022-03-15 18:56:05,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 50 SyntacticMatches, 16 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 18:56:05,282 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:05,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:56:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2022-03-15 18:56:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1226. [2022-03-15 18:56:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1225 states have (on average 3.991020408163265) internal successors, (4889), 1225 states have internal predecessors, (4889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 4889 transitions. [2022-03-15 18:56:05,300 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 4889 transitions. Word has length 22 [2022-03-15 18:56:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:05,300 INFO L470 AbstractCegarLoop]: Abstraction has 1226 states and 4889 transitions. [2022-03-15 18:56:05,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 4889 transitions. [2022-03-15 18:56:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:56:05,303 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:05,303 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:05,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:05,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 18:56:05,518 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:05,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:05,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1681179257, now seen corresponding path program 26 times [2022-03-15 18:56:05,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:05,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064867107] [2022-03-15 18:56:05,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:05,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:05,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:05,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064867107] [2022-03-15 18:56:05,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064867107] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:05,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534451717] [2022-03-15 18:56:05,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:56:05,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:05,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:05,704 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:05,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 18:56:05,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:56:05,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:05,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:56:05,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:06,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:07,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534451717] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:07,062 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:07,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 18:56:07,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1067843269] [2022-03-15 18:56:07,062 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:07,064 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:07,088 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 149 transitions. [2022-03-15 18:56:07,088 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:10,142 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [89270#(and (or (not (= 0 (mod ~d3~0 256))) (< 1 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 2) 0)) (<= ~pos~0 2) (< 0 (+ ~pos~0 3))), 89271#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 89269#(and (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (<= 2 ~pos~0) (<= ~pos~0 2))] [2022-03-15 18:56:10,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:56:10,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:10,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:56:10,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2022-03-15 18:56:10,143 INFO L87 Difference]: Start difference. First operand 1226 states and 4889 transitions. Second operand has 13 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:10,480 INFO L93 Difference]: Finished difference Result 1549 states and 5953 transitions. [2022-03-15 18:56:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 18:56:10,480 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:56:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:10,483 INFO L225 Difference]: With dead ends: 1549 [2022-03-15 18:56:10,483 INFO L226 Difference]: Without dead ends: 1510 [2022-03-15 18:56:10,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 52 SyntacticMatches, 26 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2022-03-15 18:56:10,484 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:10,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:56:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2022-03-15 18:56:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1238. [2022-03-15 18:56:10,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1237 states have (on average 3.992724333063864) internal successors, (4939), 1237 states have internal predecessors, (4939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 4939 transitions. [2022-03-15 18:56:10,503 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 4939 transitions. Word has length 22 [2022-03-15 18:56:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:10,503 INFO L470 AbstractCegarLoop]: Abstraction has 1238 states and 4939 transitions. [2022-03-15 18:56:10,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 4939 transitions. [2022-03-15 18:56:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:56:10,505 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:10,505 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:10,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:10,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 18:56:10,722 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:10,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1204257347, now seen corresponding path program 27 times [2022-03-15 18:56:10,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:10,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068024990] [2022-03-15 18:56:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:10,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:10,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:10,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068024990] [2022-03-15 18:56:10,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068024990] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:10,948 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114041563] [2022-03-15 18:56:10,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:56:10,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:10,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:10,950 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:10,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 18:56:11,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 18:56:11,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:11,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 18:56:11,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:11,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:12,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114041563] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:12,095 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:12,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-03-15 18:56:12,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [75663369] [2022-03-15 18:56:12,096 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:12,097 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:12,108 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 191 transitions. [2022-03-15 18:56:12,109 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:16,309 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [93409#(or (= 0 (mod ~d3~0 256)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1))) (= (mod ~g3~0 256) 0)), 93453#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 93401#(or (not (<= (mod ~g3~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 93454#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0))] [2022-03-15 18:56:16,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:56:16,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:16,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:56:16,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2022-03-15 18:56:16,310 INFO L87 Difference]: Start difference. First operand 1238 states and 4939 transitions. Second operand has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:17,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:17,077 INFO L93 Difference]: Finished difference Result 1975 states and 7424 transitions. [2022-03-15 18:56:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 18:56:17,077 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:56:17,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:17,081 INFO L225 Difference]: With dead ends: 1975 [2022-03-15 18:56:17,081 INFO L226 Difference]: Without dead ends: 1938 [2022-03-15 18:56:17,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 42 SyntacticMatches, 57 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 18:56:17,082 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:17,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:56:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2022-03-15 18:56:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1238. [2022-03-15 18:56:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1237 states have (on average 3.992724333063864) internal successors, (4939), 1237 states have internal predecessors, (4939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 4939 transitions. [2022-03-15 18:56:17,103 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 4939 transitions. Word has length 22 [2022-03-15 18:56:17,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:17,103 INFO L470 AbstractCegarLoop]: Abstraction has 1238 states and 4939 transitions. [2022-03-15 18:56:17,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 4939 transitions. [2022-03-15 18:56:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:56:17,106 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:17,106 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:17,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-03-15 18:56:17,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:17,322 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:17,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash -464030127, now seen corresponding path program 28 times [2022-03-15 18:56:17,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:17,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811900883] [2022-03-15 18:56:17,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:17,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:17,540 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:17,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811900883] [2022-03-15 18:56:17,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811900883] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:17,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829122806] [2022-03-15 18:56:17,540 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:56:17,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:17,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:17,548 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:17,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 18:56:17,625 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:56:17,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:17,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:56:17,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:18,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:18,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829122806] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:18,819 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:18,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 18:56:18,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1735412403] [2022-03-15 18:56:18,820 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:18,822 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:18,830 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 141 transitions. [2022-03-15 18:56:18,830 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:20,774 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [98092#(and (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (< 0 (+ ~pos~0 2)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (= (mod ~g3~0 256) 0))), 98091#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g3~0 256) 0))), 98093#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 98089#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 98090#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)))] [2022-03-15 18:56:20,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:56:20,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:20,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:56:20,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:56:20,775 INFO L87 Difference]: Start difference. First operand 1238 states and 4939 transitions. Second operand has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:21,553 INFO L93 Difference]: Finished difference Result 2053 states and 7801 transitions. [2022-03-15 18:56:21,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 18:56:21,554 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:56:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:21,558 INFO L225 Difference]: With dead ends: 2053 [2022-03-15 18:56:21,558 INFO L226 Difference]: Without dead ends: 2046 [2022-03-15 18:56:21,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=359, Invalid=1533, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 18:56:21,559 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:21,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2022-03-15 18:56:21,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1280. [2022-03-15 18:56:21,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 3.9898358092259576) internal successors, (5103), 1279 states have internal predecessors, (5103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:21,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 5103 transitions. [2022-03-15 18:56:21,583 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 5103 transitions. Word has length 22 [2022-03-15 18:56:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:21,584 INFO L470 AbstractCegarLoop]: Abstraction has 1280 states and 5103 transitions. [2022-03-15 18:56:21,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:21,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 5103 transitions. [2022-03-15 18:56:21,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:56:21,586 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:21,586 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:21,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:21,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:21,803 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:21,803 INFO L85 PathProgramCache]: Analyzing trace with hash -762183009, now seen corresponding path program 29 times [2022-03-15 18:56:21,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:21,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212107940] [2022-03-15 18:56:21,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:21,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:21,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:21,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212107940] [2022-03-15 18:56:21,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212107940] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:21,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176772238] [2022-03-15 18:56:21,996 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:56:21,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:21,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:21,997 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:22,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 18:56:22,126 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 18:56:22,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:22,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 18:56:22,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:22,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:23,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176772238] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:23,061 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:23,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:56:23,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1685925131] [2022-03-15 18:56:23,061 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:23,063 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:23,071 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 144 transitions. [2022-03-15 18:56:23,071 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:25,322 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [102887#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0)))), 102892#(and (or (= 0 (mod ~d3~0 256)) (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0))), 102888#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g3~0 256) 0)))), 102889#(and (= ~d2~0 1) (= ~g2~0 1) (<= ~pos~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1))), 102891#(and (or (not (= 0 (mod ~d3~0 256))) (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (mod ~g3~0 256) 0))), 102890#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (= ~d2~0 1) (not (= (mod ~g3~0 256) 0))) (or (<= 0 (+ ~pos~0 1)) (not (= (mod ~g3~0 256) 0)))), 102886#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 102885#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:56:25,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 18:56:25,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:25,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 18:56:25,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=865, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 18:56:25,323 INFO L87 Difference]: Start difference. First operand 1280 states and 5103 transitions. Second operand has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:27,085 INFO L93 Difference]: Finished difference Result 2123 states and 7795 transitions. [2022-03-15 18:56:27,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 18:56:27,085 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:56:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:27,090 INFO L225 Difference]: With dead ends: 2123 [2022-03-15 18:56:27,090 INFO L226 Difference]: Without dead ends: 2102 [2022-03-15 18:56:27,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 56 SyntacticMatches, 12 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=847, Invalid=3059, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 18:56:27,090 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 303 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:27,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 0 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:56:27,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2022-03-15 18:56:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 1296. [2022-03-15 18:56:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1295 states have (on average 3.9953667953667953) internal successors, (5174), 1295 states have internal predecessors, (5174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 5174 transitions. [2022-03-15 18:56:27,113 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 5174 transitions. Word has length 22 [2022-03-15 18:56:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:27,113 INFO L470 AbstractCegarLoop]: Abstraction has 1296 states and 5174 transitions. [2022-03-15 18:56:27,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 5174 transitions. [2022-03-15 18:56:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:56:27,115 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:27,115 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:27,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-03-15 18:56:27,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:27,331 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:27,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:27,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1282950359, now seen corresponding path program 30 times [2022-03-15 18:56:27,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:27,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218638529] [2022-03-15 18:56:27,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:27,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:27,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:27,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218638529] [2022-03-15 18:56:27,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218638529] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:27,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984126205] [2022-03-15 18:56:27,526 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:56:27,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:27,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:27,527 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:27,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 18:56:27,611 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 18:56:27,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:27,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 18:56:27,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:27,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:27,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:28,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:28,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984126205] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:28,702 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:28,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 18:56:28,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [458392363] [2022-03-15 18:56:28,702 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:28,704 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:28,711 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 122 transitions. [2022-03-15 18:56:28,711 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:30,483 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [107822#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0))), 107817#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 0) (<= 0 ~pos~0)), 107816#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0)))), 107821#(and (or (not (= 0 (mod ~d3~0 256))) (<= 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0))), 107792#(or (not (<= (mod ~g3~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 107819#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (= ~d2~0 1) (not (= (mod ~g3~0 256) 0))) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 107818#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (not (= (mod ~g3~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (not (= (mod ~g3~0 256) 0)) (<= 3 ~pos~0)) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 3) (not (= (mod ~g3~0 256) 0)))), 107820#(and (or (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~d2~0 1) (not (= (mod ~g3~0 256) 0))))] [2022-03-15 18:56:30,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 18:56:30,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:30,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 18:56:30,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:56:30,484 INFO L87 Difference]: Start difference. First operand 1296 states and 5174 transitions. Second operand has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:31,838 INFO L93 Difference]: Finished difference Result 2996 states and 10801 transitions. [2022-03-15 18:56:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 18:56:31,839 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:56:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:31,844 INFO L225 Difference]: With dead ends: 2996 [2022-03-15 18:56:31,845 INFO L226 Difference]: Without dead ends: 2924 [2022-03-15 18:56:31,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 41 SyntacticMatches, 21 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=475, Invalid=2495, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 18:56:31,845 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 449 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:31,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 0 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:56:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2022-03-15 18:56:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1378. [2022-03-15 18:56:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1377 states have (on average 4.061002178649238) internal successors, (5592), 1377 states have internal predecessors, (5592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 5592 transitions. [2022-03-15 18:56:31,874 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 5592 transitions. Word has length 22 [2022-03-15 18:56:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:31,874 INFO L470 AbstractCegarLoop]: Abstraction has 1378 states and 5592 transitions. [2022-03-15 18:56:31,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 5592 transitions. [2022-03-15 18:56:31,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:56:31,876 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:31,876 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:31,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:32,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-03-15 18:56:32,093 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:32,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash 755642167, now seen corresponding path program 31 times [2022-03-15 18:56:32,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:32,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516973568] [2022-03-15 18:56:32,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:32,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:32,262 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:32,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516973568] [2022-03-15 18:56:32,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516973568] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:32,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842571593] [2022-03-15 18:56:32,262 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:56:32,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:32,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:32,263 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:32,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 18:56:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:32,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 18:56:32,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:32,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:56:33,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842571593] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:33,106 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:33,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 20 [2022-03-15 18:56:33,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [486115331] [2022-03-15 18:56:33,107 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:33,108 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:33,115 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 122 transitions. [2022-03-15 18:56:33,115 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:35,446 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [113771#(and (= ~d2~0 1) (= ~g2~0 1) (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 2) 0)) (<= ~pos~0 2) (<= 0 (+ ~pos~0 2)) (= ~d1~0 1) (or (not (= 0 (mod ~d3~0 256))) (<= 2 ~pos~0)))] [2022-03-15 18:56:35,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 18:56:35,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:35,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 18:56:35,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-03-15 18:56:35,446 INFO L87 Difference]: Start difference. First operand 1378 states and 5592 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:35,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:35,677 INFO L93 Difference]: Finished difference Result 1511 states and 6024 transitions. [2022-03-15 18:56:35,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 18:56:35,678 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:56:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:35,681 INFO L225 Difference]: With dead ends: 1511 [2022-03-15 18:56:35,681 INFO L226 Difference]: Without dead ends: 1504 [2022-03-15 18:56:35,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 31 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2022-03-15 18:56:35,681 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:35,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2022-03-15 18:56:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1386. [2022-03-15 18:56:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1385 states have (on average 4.0577617328519855) internal successors, (5620), 1385 states have internal predecessors, (5620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 5620 transitions. [2022-03-15 18:56:35,700 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 5620 transitions. Word has length 22 [2022-03-15 18:56:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:35,700 INFO L470 AbstractCegarLoop]: Abstraction has 1386 states and 5620 transitions. [2022-03-15 18:56:35,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 5620 transitions. [2022-03-15 18:56:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:56:35,703 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:35,703 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:35,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:35,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:35,919 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:35,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:35,919 INFO L85 PathProgramCache]: Analyzing trace with hash -480400919, now seen corresponding path program 32 times [2022-03-15 18:56:35,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:35,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551677805] [2022-03-15 18:56:35,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:35,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:36,160 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:36,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551677805] [2022-03-15 18:56:36,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551677805] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:36,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918580570] [2022-03-15 18:56:36,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:56:36,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:36,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:36,161 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:36,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 18:56:36,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:56:36,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:36,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:56:36,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:36,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:37,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918580570] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:37,296 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:37,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 18:56:37,296 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [727744260] [2022-03-15 18:56:37,296 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:37,298 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:37,304 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 112 transitions. [2022-03-15 18:56:37,305 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:39,156 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [118221#(and (or (not (= 0 (mod ~d3~0 256))) (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (+ (- 1) ~d1~0) 0) (= (mod ~g3~0 256) 0))), 118222#(and (or (= 0 (mod ~d3~0 256)) (= (+ (- 1) ~d1~0) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0))), 118212#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 118220#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (= (+ (- 1) ~d1~0) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g3~0 256) 0)))), 118218#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 3 ~pos~0)) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 3) (not (= (mod ~g3~0 256) 0)))), 118217#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (= ~g2~0 1) (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 118162#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 118213#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 118215#(and (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 118214#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 118216#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 118219#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (= (+ (- 1) ~d1~0) 0) (not (= (mod ~g3~0 256) 0))) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))))] [2022-03-15 18:56:39,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 18:56:39,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:39,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 18:56:39,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1140, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 18:56:39,157 INFO L87 Difference]: Start difference. First operand 1386 states and 5620 transitions. Second operand has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:41,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:41,916 INFO L93 Difference]: Finished difference Result 2944 states and 10666 transitions. [2022-03-15 18:56:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 18:56:41,916 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:56:41,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:41,922 INFO L225 Difference]: With dead ends: 2944 [2022-03-15 18:56:41,923 INFO L226 Difference]: Without dead ends: 2916 [2022-03-15 18:56:41,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2352 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1195, Invalid=6287, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 18:56:41,931 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 613 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:41,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 0 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 18:56:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2022-03-15 18:56:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1412. [2022-03-15 18:56:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1411 states have (on average 4.070163004961021) internal successors, (5743), 1411 states have internal predecessors, (5743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 5743 transitions. [2022-03-15 18:56:41,997 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 5743 transitions. Word has length 22 [2022-03-15 18:56:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:41,997 INFO L470 AbstractCegarLoop]: Abstraction has 1412 states and 5743 transitions. [2022-03-15 18:56:41,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 5743 transitions. [2022-03-15 18:56:42,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:56:42,000 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:42,000 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:42,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:42,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:42,238 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:42,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:42,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1626383201, now seen corresponding path program 33 times [2022-03-15 18:56:42,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:42,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727392487] [2022-03-15 18:56:42,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:42,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:42,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:42,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727392487] [2022-03-15 18:56:42,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727392487] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:42,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691141403] [2022-03-15 18:56:42,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:56:42,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:42,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:42,491 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:42,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 18:56:42,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 18:56:42,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:42,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:56:42,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:42,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:56:43,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691141403] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:43,231 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:43,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2022-03-15 18:56:43,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2010166341] [2022-03-15 18:56:43,231 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:43,238 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:43,245 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 124 transitions. [2022-03-15 18:56:43,246 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:45,226 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [124246#(and (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0)))), 124193#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 124247#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (< 0 (+ ~pos~0 1)))), 124243#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 124254#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (= (+ (- 1) ~d1~0) 0) (not (= (mod ~g3~0 256) 0))) (or (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0)))), 124251#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)) (<= 1 ~g1~0)) (or (= ~g2~0 1) (<= (div ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (<= (div ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0) (<= 1 ~g1~0))), 124248#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 124253#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0)) (or (= (+ (- 1) ~d1~0) 0) (not (= (mod ~g3~0 256) 0))) (or (= ~g1~0 1) (not (= (mod ~g3~0 256) 0)))), 124250#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 124257#(and (or (= 0 (mod ~d3~0 256)) (= (+ (- 1) ~d1~0) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g1~0 1) (= (mod ~g3~0 256) 0))), 124256#(and (or (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (+ (- 1) ~d1~0) 0) (= (mod ~g3~0 256) 0))), 124249#(and (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 124242#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 124255#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (= (+ (- 1) ~d1~0) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))) (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g3~0 256) 0)))), 124245#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 124252#(and (or (= (+ (- 1) ~g1~0) 0) (not (= (mod ~g3~0 256) 0)) (= ~g1~0 0)) (or (= ~g2~0 1) (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (+ (- 1) ~g1~0) 0) (not (= (mod ~g3~0 256) 0)) (not (= (* 256 (div ~d1~0 256)) ~d1~0))) (or (= ~g2~0 1) (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 124244#(and (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (= (mod ~g1~0 256) 0)))] [2022-03-15 18:56:45,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 18:56:45,226 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:45,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 18:56:45,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1436, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 18:56:45,227 INFO L87 Difference]: Start difference. First operand 1412 states and 5743 transitions. Second operand has 29 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:53,545 INFO L93 Difference]: Finished difference Result 3407 states and 11938 transitions. [2022-03-15 18:56:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-03-15 18:56:53,546 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:56:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:53,553 INFO L225 Difference]: With dead ends: 3407 [2022-03-15 18:56:53,553 INFO L226 Difference]: Without dead ends: 3334 [2022-03-15 18:56:53,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 42 SyntacticMatches, 10 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9952 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=4759, Invalid=21647, Unknown=0, NotChecked=0, Total=26406 [2022-03-15 18:56:53,555 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 783 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:53,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [783 Valid, 0 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 18:56:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2022-03-15 18:56:53,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 1426. [2022-03-15 18:56:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1425 states have (on average 4.074385964912281) internal successors, (5806), 1425 states have internal predecessors, (5806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 5806 transitions. [2022-03-15 18:56:53,588 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 5806 transitions. Word has length 22 [2022-03-15 18:56:53,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:53,588 INFO L470 AbstractCegarLoop]: Abstraction has 1426 states and 5806 transitions. [2022-03-15 18:56:53,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 5806 transitions. [2022-03-15 18:56:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:56:53,610 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:53,610 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:53,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:53,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 18:56:53,819 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:53,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:53,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1030929437, now seen corresponding path program 34 times [2022-03-15 18:56:53,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:53,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677392866] [2022-03-15 18:56:53,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:53,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:54,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:54,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677392866] [2022-03-15 18:56:54,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677392866] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:54,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161318802] [2022-03-15 18:56:54,107 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:56:54,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:54,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:54,109 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:54,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 18:56:54,193 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:56:54,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:54,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:56:54,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:54,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:55,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161318802] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:55,221 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:55,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 18:56:55,221 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2077491099] [2022-03-15 18:56:55,221 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:55,223 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:55,231 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 139 transitions. [2022-03-15 18:56:55,231 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:58,302 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [130917#(and (or (not (= 0 (mod ~d3~0 256))) (<= 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0))), 130918#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0))), 130911#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 130914#(and (= ~d2~0 1) (= ~g2~0 1) (<= ~pos~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1))), 130910#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 130913#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g3~0 256) 0)))), 130915#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (= ~d2~0 1) (not (= (mod ~g3~0 256) 0))) (or (<= 0 (+ ~pos~0 1)) (not (= (mod ~g3~0 256) 0)))), 130912#(and (or (<= 2 ~pos~0) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 2) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0))), 130916#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)))] [2022-03-15 18:56:58,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 18:56:58,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:58,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 18:56:58,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1017, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 18:56:58,303 INFO L87 Difference]: Start difference. First operand 1426 states and 5806 transitions. Second operand has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:02,441 INFO L93 Difference]: Finished difference Result 3392 states and 12915 transitions. [2022-03-15 18:57:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 18:57:02,441 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:57:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:02,447 INFO L225 Difference]: With dead ends: 3392 [2022-03-15 18:57:02,447 INFO L226 Difference]: Without dead ends: 3378 [2022-03-15 18:57:02,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 51 SyntacticMatches, 13 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3053 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1793, Invalid=7713, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 18:57:02,450 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 485 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:02,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 0 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 18:57:02,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3378 states. [2022-03-15 18:57:02,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3378 to 1468. [2022-03-15 18:57:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1467 states have (on average 4.094751192910702) internal successors, (6007), 1467 states have internal predecessors, (6007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 6007 transitions. [2022-03-15 18:57:02,488 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 6007 transitions. Word has length 22 [2022-03-15 18:57:02,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:02,488 INFO L470 AbstractCegarLoop]: Abstraction has 1468 states and 6007 transitions. [2022-03-15 18:57:02,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 6007 transitions. [2022-03-15 18:57:02,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:57:02,491 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:02,491 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:02,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:02,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 18:57:02,707 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:02,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:02,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1551696787, now seen corresponding path program 35 times [2022-03-15 18:57:02,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:02,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074568943] [2022-03-15 18:57:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:02,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:02,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:02,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074568943] [2022-03-15 18:57:02,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074568943] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:02,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328265958] [2022-03-15 18:57:02,903 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:57:02,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:02,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:02,916 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:02,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 18:57:03,005 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 18:57:03,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:03,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 18:57:03,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:03,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:04,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328265958] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:04,110 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:04,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2022-03-15 18:57:04,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1922317207] [2022-03-15 18:57:04,111 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:04,112 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:04,119 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 117 transitions. [2022-03-15 18:57:04,119 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:05,234 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [137530#(and (or (not (= 0 (mod ~d3~0 256))) (<= 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0))), 137529#(and (or (not (= 0 (mod ~d3~0 256))) (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0))), 137531#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0))), 137527#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (not (= (mod ~g3~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (not (= (mod ~g3~0 256) 0)) (<= 3 ~pos~0)) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 3) (not (= (mod ~g3~0 256) 0)))), 137528#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (= ~d2~0 1) (not (= (mod ~g3~0 256) 0))) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 137525#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 137526#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))))] [2022-03-15 18:57:05,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:57:05,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:05,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:57:05,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 18:57:05,236 INFO L87 Difference]: Start difference. First operand 1468 states and 6007 transitions. Second operand has 17 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:07,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:07,302 INFO L93 Difference]: Finished difference Result 3560 states and 13393 transitions. [2022-03-15 18:57:07,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 18:57:07,302 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:57:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:07,310 INFO L225 Difference]: With dead ends: 3560 [2022-03-15 18:57:07,310 INFO L226 Difference]: Without dead ends: 3492 [2022-03-15 18:57:07,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1647 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=975, Invalid=4281, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 18:57:07,314 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 424 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:07,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 0 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 18:57:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2022-03-15 18:57:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 1628. [2022-03-15 18:57:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1627 states have (on average 4.1450522433927475) internal successors, (6744), 1627 states have internal predecessors, (6744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 6744 transitions. [2022-03-15 18:57:07,371 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 6744 transitions. Word has length 22 [2022-03-15 18:57:07,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:07,371 INFO L470 AbstractCegarLoop]: Abstraction has 1628 states and 6744 transitions. [2022-03-15 18:57:07,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 6744 transitions. [2022-03-15 18:57:07,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:57:07,374 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:07,374 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:07,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:07,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 18:57:07,607 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:07,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1049562435, now seen corresponding path program 36 times [2022-03-15 18:57:07,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:07,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937426270] [2022-03-15 18:57:07,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:07,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:07,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:07,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937426270] [2022-03-15 18:57:07,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937426270] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:07,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003569048] [2022-03-15 18:57:07,865 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:57:07,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:07,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:07,866 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:07,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 18:57:07,990 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 18:57:07,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:07,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 18:57:07,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:08,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:09,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003569048] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:09,173 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:09,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-03-15 18:57:09,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [195749853] [2022-03-15 18:57:09,174 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:09,176 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:09,182 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 112 transitions. [2022-03-15 18:57:09,182 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:10,475 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [144574#(and (<= 1 ~pos~0) (<= ~pos~0 3) (or (not (= (mod ~d1~0 256) 0)) (<= 3 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1)) (= (* (div ~d2~0 256) 256) ~d2~0)), 144575#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (= (* (div ~d2~0 256) 256) ~d2~0)) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0)))), 144576#(and (not (= (mod ~d1~0 256) 0)) (or (<= ~pos~0 2) (= ~g3~0 0)) (or (not (= (* (div ~d3~0 256) 256) ~d3~0)) (not (= ~g3~0 0))) (or (<= 2 ~pos~0) (= ~g3~0 0)) (or (= (+ (- 1) ~d2~0) 0) (= ~g3~0 0)) (or (= ~g3~0 1) (= ~g3~0 0))), 144577#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 144573#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:57:10,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:57:10,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:10,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:57:10,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:57:10,476 INFO L87 Difference]: Start difference. First operand 1628 states and 6744 transitions. Second operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:11,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:11,421 INFO L93 Difference]: Finished difference Result 2301 states and 8866 transitions. [2022-03-15 18:57:11,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:57:11,421 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:57:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:11,426 INFO L225 Difference]: With dead ends: 2301 [2022-03-15 18:57:11,426 INFO L226 Difference]: Without dead ends: 2270 [2022-03-15 18:57:11,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 18:57:11,427 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 203 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:11,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 0 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:57:11,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2022-03-15 18:57:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1676. [2022-03-15 18:57:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1675 states have (on average 4.162388059701493) internal successors, (6972), 1675 states have internal predecessors, (6972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 6972 transitions. [2022-03-15 18:57:11,459 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 6972 transitions. Word has length 22 [2022-03-15 18:57:11,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:11,459 INFO L470 AbstractCegarLoop]: Abstraction has 1676 states and 6972 transitions. [2022-03-15 18:57:11,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 6972 transitions. [2022-03-15 18:57:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:57:11,462 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:11,462 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:11,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:11,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 18:57:11,674 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:11,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:11,674 INFO L85 PathProgramCache]: Analyzing trace with hash 75668447, now seen corresponding path program 37 times [2022-03-15 18:57:11,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:11,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837259014] [2022-03-15 18:57:11,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:11,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:11,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:11,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837259014] [2022-03-15 18:57:11,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837259014] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:11,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013134714] [2022-03-15 18:57:11,956 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:57:11,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:11,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:11,964 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:11,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 18:57:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:12,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 18:57:12,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:12,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:13,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013134714] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:13,428 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:13,428 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2022-03-15 18:57:13,428 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2119590556] [2022-03-15 18:57:13,428 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:13,430 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:13,436 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 102 transitions. [2022-03-15 18:57:13,436 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:14,465 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [150414#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 150413#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 150410#(and (or (<= ~pos~0 2) (= ~g3~0 0)) (or (not (= (* (div ~d3~0 256) 256) ~d3~0)) (not (= ~g3~0 0))) (or (not (= (mod ~d1~0 256) 0)) (= ~g3~0 0)) (or (<= 2 ~pos~0) (= ~g3~0 0)) (or (= ~g3~0 1) (= ~g3~0 0))), 150412#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 150409#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 150411#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)))] [2022-03-15 18:57:14,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:57:14,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:14,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:57:14,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=920, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 18:57:14,466 INFO L87 Difference]: Start difference. First operand 1676 states and 6972 transitions. Second operand has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:15,660 INFO L93 Difference]: Finished difference Result 2440 states and 9331 transitions. [2022-03-15 18:57:15,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 18:57:15,660 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:57:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:15,665 INFO L225 Difference]: With dead ends: 2440 [2022-03-15 18:57:15,665 INFO L226 Difference]: Without dead ends: 2426 [2022-03-15 18:57:15,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=409, Invalid=2141, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 18:57:15,665 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 219 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:15,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 0 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 18:57:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2022-03-15 18:57:15,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 1720. [2022-03-15 18:57:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1719 states have (on average 4.155904595695172) internal successors, (7144), 1719 states have internal predecessors, (7144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 7144 transitions. [2022-03-15 18:57:15,694 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 7144 transitions. Word has length 22 [2022-03-15 18:57:15,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:15,694 INFO L470 AbstractCegarLoop]: Abstraction has 1720 states and 7144 transitions. [2022-03-15 18:57:15,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 7144 transitions. [2022-03-15 18:57:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:57:15,698 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:15,698 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:15,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:15,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 18:57:15,914 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:15,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash 606663295, now seen corresponding path program 38 times [2022-03-15 18:57:15,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:15,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859027850] [2022-03-15 18:57:15,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:15,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:16,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:16,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859027850] [2022-03-15 18:57:16,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859027850] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:16,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440445265] [2022-03-15 18:57:16,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:57:16,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:16,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:16,159 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:16,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 18:57:16,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:57:16,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:16,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 18:57:16,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:16,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:16,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:17,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:17,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440445265] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:17,409 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:17,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 18:57:17,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [998706805] [2022-03-15 18:57:17,409 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:17,410 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:17,417 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 116 transitions. [2022-03-15 18:57:17,417 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:18,741 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [156486#(and (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 4) (= (mod ~g3~0 256) 0))), 156485#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0)))), 156483#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 156487#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0))), 156484#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (or (<= ~pos~0 2) (not (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0))) (or (<= 2 ~pos~0) (not (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0))) (or (= ~g3~0 1) (= ~g3~0 0))), 156482#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:57:18,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:57:18,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:57:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 18:57:18,742 INFO L87 Difference]: Start difference. First operand 1720 states and 7144 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:20,654 INFO L93 Difference]: Finished difference Result 2913 states and 11049 transitions. [2022-03-15 18:57:20,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 18:57:20,654 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:57:20,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:20,660 INFO L225 Difference]: With dead ends: 2913 [2022-03-15 18:57:20,660 INFO L226 Difference]: Without dead ends: 2906 [2022-03-15 18:57:20,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=929, Invalid=4327, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 18:57:20,661 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 315 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:20,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 0 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:57:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2022-03-15 18:57:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1720. [2022-03-15 18:57:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1719 states have (on average 4.155904595695172) internal successors, (7144), 1719 states have internal predecessors, (7144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 7144 transitions. [2022-03-15 18:57:20,692 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 7144 transitions. Word has length 22 [2022-03-15 18:57:20,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:20,692 INFO L470 AbstractCegarLoop]: Abstraction has 1720 states and 7144 transitions. [2022-03-15 18:57:20,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 7144 transitions. [2022-03-15 18:57:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:57:20,695 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:20,696 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:20,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-03-15 18:57:20,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-03-15 18:57:20,912 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:20,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:20,913 INFO L85 PathProgramCache]: Analyzing trace with hash -751755201, now seen corresponding path program 39 times [2022-03-15 18:57:20,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:20,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040538071] [2022-03-15 18:57:20,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:20,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:21,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:21,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040538071] [2022-03-15 18:57:21,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040538071] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:21,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028446984] [2022-03-15 18:57:21,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:57:21,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:21,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:21,084 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:21,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 18:57:21,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 18:57:21,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:21,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:57:21,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:21,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:22,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028446984] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:22,031 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:22,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 18:57:22,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [455284004] [2022-03-15 18:57:22,032 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:22,033 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:22,040 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 120 transitions. [2022-03-15 18:57:22,040 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:23,973 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [163074#(and (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= 2 ~pos~0) (<= ~pos~0 2) (= (* (div ~d3~0 256) 256) ~d3~0)), 163073#(and (or (not (= 0 (mod ~d3~0 256))) (< 1 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 2) 0)) (<= ~pos~0 2) (< 0 (+ ~pos~0 3))), 163075#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= ~pos~0 0) (<= 0 ~pos~0))] [2022-03-15 18:57:23,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:57:23,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:23,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:57:23,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2022-03-15 18:57:23,974 INFO L87 Difference]: Start difference. First operand 1720 states and 7144 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:24,428 INFO L93 Difference]: Finished difference Result 1895 states and 7667 transitions. [2022-03-15 18:57:24,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 18:57:24,429 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:57:24,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:24,433 INFO L225 Difference]: With dead ends: 1895 [2022-03-15 18:57:24,433 INFO L226 Difference]: Without dead ends: 1858 [2022-03-15 18:57:24,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 43 SyntacticMatches, 21 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 18:57:24,433 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:24,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:57:24,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2022-03-15 18:57:24,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1750. [2022-03-15 18:57:24,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1749 states have (on average 4.141223556317896) internal successors, (7243), 1749 states have internal predecessors, (7243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 7243 transitions. [2022-03-15 18:57:24,458 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 7243 transitions. Word has length 22 [2022-03-15 18:57:24,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:24,458 INFO L470 AbstractCegarLoop]: Abstraction has 1750 states and 7243 transitions. [2022-03-15 18:57:24,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 7243 transitions. [2022-03-15 18:57:24,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:57:24,461 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:24,461 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:24,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:24,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 18:57:24,675 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:24,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:24,676 INFO L85 PathProgramCache]: Analyzing trace with hash -471849673, now seen corresponding path program 40 times [2022-03-15 18:57:24,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:24,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799341264] [2022-03-15 18:57:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:24,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:24,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:24,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799341264] [2022-03-15 18:57:24,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799341264] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:24,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614006461] [2022-03-15 18:57:24,973 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:57:24,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:24,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:24,975 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:24,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 18:57:25,066 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:57:25,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:25,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:57:25,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:25,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:25,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614006461] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:25,921 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:25,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2022-03-15 18:57:25,921 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [904669393] [2022-03-15 18:57:25,921 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:25,923 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:25,929 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 117 transitions. [2022-03-15 18:57:25,930 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:28,020 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [168644#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 168647#(and (or (= ~g2~0 0) (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)))), 168642#(and (or (<= 1 ~pos~0) (= ~g2~0 0) (= (mod ~g1~0 256) 0) (<= 1 ~g1~0)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 0) (= (mod ~g1~0 256) 0) (<= 3 ~pos~0)) (or (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g1~0 256) 0) (<= 1 ~g1~0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= ~g2~0 0) (= (mod ~g1~0 256) 0) (<= (div ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= ~g2~0 0) (= (mod ~g1~0 256) 0) (<= 1 ~g1~0)) (or (<= 1 ~pos~0) (= ~g2~0 0) (= (mod ~g1~0 256) 0) (<= (div ~g1~0 256) 0)) (or (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g1~0 256) 0) (<= (div ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 0) (<= ~pos~0 3) (= (mod ~g1~0 256) 0))), 168645#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 168648#(and (or (= ~g2~0 0) (<= 2 ~pos~0) (= (mod ~g1~0 256) 0) (<= 1 ~g1~0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 0) (<= ~pos~0 2) (= (mod ~g1~0 256) 0)) (or (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g1~0 256) 0) (<= 1 ~g1~0)) (or (= ~g2~0 0) (<= ~pos~0 2) (= (mod ~g1~0 256) 0) (<= (div ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 0) (<= 2 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= ~g2~0 0) (<= 2 ~pos~0) (= (mod ~g1~0 256) 0) (<= (div ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g1~0 256) 0)) (or (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g1~0 256) 0) (<= (div ~g1~0 256) 0)) (or (= ~g2~0 0) (<= ~pos~0 2) (= (mod ~g1~0 256) 0) (<= 1 ~g1~0))), 168649#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~d1~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g1~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 168646#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 168640#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 168641#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 168643#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:57:28,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 18:57:28,021 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:28,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 18:57:28,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1108, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 18:57:28,022 INFO L87 Difference]: Start difference. First operand 1750 states and 7243 transitions. Second operand has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:36,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:36,483 INFO L93 Difference]: Finished difference Result 3783 states and 13592 transitions. [2022-03-15 18:57:36,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 18:57:36,483 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:57:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:36,490 INFO L225 Difference]: With dead ends: 3783 [2022-03-15 18:57:36,490 INFO L226 Difference]: Without dead ends: 3748 [2022-03-15 18:57:36,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 44 SyntacticMatches, 12 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4114 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2008, Invalid=11798, Unknown=0, NotChecked=0, Total=13806 [2022-03-15 18:57:36,492 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 557 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:36,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [557 Valid, 0 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 18:57:36,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2022-03-15 18:57:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 1786. [2022-03-15 18:57:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1785 states have (on average 4.143417366946779) internal successors, (7396), 1785 states have internal predecessors, (7396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 7396 transitions. [2022-03-15 18:57:36,546 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 7396 transitions. Word has length 22 [2022-03-15 18:57:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:36,546 INFO L470 AbstractCegarLoop]: Abstraction has 1786 states and 7396 transitions. [2022-03-15 18:57:36,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 7396 transitions. [2022-03-15 18:57:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:57:36,549 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:36,550 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:36,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:36,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 18:57:36,766 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:36,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1445743661, now seen corresponding path program 41 times [2022-03-15 18:57:36,767 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:36,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934480438] [2022-03-15 18:57:36,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:36,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:36,952 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:36,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934480438] [2022-03-15 18:57:36,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934480438] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:36,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479548934] [2022-03-15 18:57:36,953 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:57:36,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:36,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:36,954 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:36,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 18:57:37,049 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 18:57:37,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:37,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 18:57:37,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:37,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:38,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479548934] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:38,202 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:38,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 25 [2022-03-15 18:57:38,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [894500092] [2022-03-15 18:57:38,202 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:38,204 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:38,210 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 107 transitions. [2022-03-15 18:57:38,210 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:39,189 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [176320#(and (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 176322#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 176321#(and (not (= (mod ~d1~0 256) 0)) (<= 2 ~pos~0) (<= ~pos~0 2) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0))] [2022-03-15 18:57:39,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 18:57:39,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:39,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 18:57:39,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:57:39,189 INFO L87 Difference]: Start difference. First operand 1786 states and 7396 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:39,419 INFO L93 Difference]: Finished difference Result 2267 states and 8980 transitions. [2022-03-15 18:57:39,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 18:57:39,419 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:57:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:39,424 INFO L225 Difference]: With dead ends: 2267 [2022-03-15 18:57:39,424 INFO L226 Difference]: Without dead ends: 2254 [2022-03-15 18:57:39,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:57:39,425 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:39,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:57:39,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2022-03-15 18:57:39,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1788. [2022-03-15 18:57:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1787 states have (on average 4.141578063794069) internal successors, (7401), 1787 states have internal predecessors, (7401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 7401 transitions. [2022-03-15 18:57:39,454 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 7401 transitions. Word has length 22 [2022-03-15 18:57:39,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:39,454 INFO L470 AbstractCegarLoop]: Abstraction has 1788 states and 7401 transitions. [2022-03-15 18:57:39,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 7401 transitions. [2022-03-15 18:57:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:57:39,458 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:39,458 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:39,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:39,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:39,674 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:39,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:39,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1316821125, now seen corresponding path program 42 times [2022-03-15 18:57:39,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:39,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900730823] [2022-03-15 18:57:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:39,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:39,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:39,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900730823] [2022-03-15 18:57:39,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900730823] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:39,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132002917] [2022-03-15 18:57:39,882 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:57:39,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:39,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:39,883 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:39,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 18:57:39,960 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 18:57:39,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:39,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 18:57:39,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:40,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:40,983 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132002917] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:40,983 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:40,983 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 18:57:40,983 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1737751925] [2022-03-15 18:57:40,984 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:40,985 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:40,992 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 112 transitions. [2022-03-15 18:57:40,992 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:42,284 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [182318#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 182320#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d1~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 182317#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 182321#(and (or (<= 2 ~pos~0) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 2) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)))), 182319#(and (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (not (= (mod ~d1~0 256) 0)) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (<= 3 ~pos~0)) (or (<= ~pos~0 3) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (= ~g2~0 1) (= ~g2~0 0)) (or (<= 1 ~pos~0) (not (= (* (div ~d2~0 256) 256) ~d2~0))))] [2022-03-15 18:57:42,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:57:42,285 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:42,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:57:42,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:57:42,285 INFO L87 Difference]: Start difference. First operand 1788 states and 7401 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:44,587 INFO L93 Difference]: Finished difference Result 2600 states and 9847 transitions. [2022-03-15 18:57:44,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 18:57:44,587 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:57:44,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:44,592 INFO L225 Difference]: With dead ends: 2600 [2022-03-15 18:57:44,592 INFO L226 Difference]: Without dead ends: 2586 [2022-03-15 18:57:44,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 47 SyntacticMatches, 13 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=691, Invalid=3599, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 18:57:44,594 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 305 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:44,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 0 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:57:44,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2022-03-15 18:57:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 1806. [2022-03-15 18:57:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1805 states have (on average 4.1407202216066485) internal successors, (7474), 1805 states have internal predecessors, (7474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 7474 transitions. [2022-03-15 18:57:44,623 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 7474 transitions. Word has length 22 [2022-03-15 18:57:44,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:44,623 INFO L470 AbstractCegarLoop]: Abstraction has 1806 states and 7474 transitions. [2022-03-15 18:57:44,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 7474 transitions. [2022-03-15 18:57:44,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:57:44,627 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:44,627 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:44,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:44,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:44,840 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:44,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:44,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2004252183, now seen corresponding path program 43 times [2022-03-15 18:57:44,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:44,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325400061] [2022-03-15 18:57:44,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:44,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:45,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:45,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325400061] [2022-03-15 18:57:45,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325400061] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:45,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37600523] [2022-03-15 18:57:45,067 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:57:45,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:45,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:45,084 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:45,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 18:57:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:45,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:57:45,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:45,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:46,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37600523] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:46,191 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:46,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 18:57:46,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2028135829] [2022-03-15 18:57:46,192 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:46,193 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:46,199 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 102 transitions. [2022-03-15 18:57:46,199 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:47,511 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [188763#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~d1~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 188760#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 188708#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 188758#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 188762#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 188759#(and (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 188761#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))))] [2022-03-15 18:57:47,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:57:47,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:47,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:57:47,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2022-03-15 18:57:47,512 INFO L87 Difference]: Start difference. First operand 1806 states and 7474 transitions. Second operand has 17 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:49,428 INFO L93 Difference]: Finished difference Result 2654 states and 10054 transitions. [2022-03-15 18:57:49,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 18:57:49,429 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:57:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:49,434 INFO L225 Difference]: With dead ends: 2654 [2022-03-15 18:57:49,434 INFO L226 Difference]: Without dead ends: 2622 [2022-03-15 18:57:49,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=467, Invalid=2503, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 18:57:49,435 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 304 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:49,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 0 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 18:57:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2022-03-15 18:57:49,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 1844. [2022-03-15 18:57:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1843 states have (on average 4.155724362452523) internal successors, (7659), 1843 states have internal predecessors, (7659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 7659 transitions. [2022-03-15 18:57:49,467 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 7659 transitions. Word has length 22 [2022-03-15 18:57:49,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:49,467 INFO L470 AbstractCegarLoop]: Abstraction has 1844 states and 7659 transitions. [2022-03-15 18:57:49,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:49,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 7659 transitions. [2022-03-15 18:57:49,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:57:49,471 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:49,471 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:49,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-03-15 18:57:49,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 18:57:49,689 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:49,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:49,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1759720265, now seen corresponding path program 44 times [2022-03-15 18:57:49,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:49,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175016723] [2022-03-15 18:57:49,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:49,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:49,899 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:49,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175016723] [2022-03-15 18:57:49,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175016723] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:49,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378398414] [2022-03-15 18:57:49,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:57:49,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:49,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:49,901 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:49,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 18:57:49,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:57:49,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:50,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:57:50,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:50,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:51,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378398414] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:51,047 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:51,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 23 [2022-03-15 18:57:51,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [418803904] [2022-03-15 18:57:51,047 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:51,049 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:51,056 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 116 transitions. [2022-03-15 18:57:51,056 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:52,430 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [195304#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~d1~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 195303#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 195306#(and (or (not (= 0 (mod ~d3~0 256))) (= (* (div ~d2~0 256) 256) ~d2~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 4) (= (mod ~g3~0 256) 0))), 195305#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))))] [2022-03-15 18:57:52,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:57:52,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:52,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:57:52,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2022-03-15 18:57:52,431 INFO L87 Difference]: Start difference. First operand 1844 states and 7659 transitions. Second operand has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:53,294 INFO L93 Difference]: Finished difference Result 2683 states and 10367 transitions. [2022-03-15 18:57:53,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 18:57:53,295 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:57:53,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:53,300 INFO L225 Difference]: With dead ends: 2683 [2022-03-15 18:57:53,300 INFO L226 Difference]: Without dead ends: 2676 [2022-03-15 18:57:53,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 10 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=324, Invalid=1398, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 18:57:53,301 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:53,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:57:53,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2022-03-15 18:57:53,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1886. [2022-03-15 18:57:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1885 states have (on average 4.154907161803713) internal successors, (7832), 1885 states have internal predecessors, (7832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 7832 transitions. [2022-03-15 18:57:53,333 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 7832 transitions. Word has length 22 [2022-03-15 18:57:53,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:53,333 INFO L470 AbstractCegarLoop]: Abstraction has 1886 states and 7832 transitions. [2022-03-15 18:57:53,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 7832 transitions. [2022-03-15 18:57:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:57:53,337 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:53,337 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:53,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-03-15 18:57:53,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 18:57:53,539 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:53,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:53,540 INFO L85 PathProgramCache]: Analyzing trace with hash 542551955, now seen corresponding path program 45 times [2022-03-15 18:57:53,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:53,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495976132] [2022-03-15 18:57:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:53,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:53,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:53,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495976132] [2022-03-15 18:57:53,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495976132] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:53,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455467057] [2022-03-15 18:57:53,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:57:53,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:53,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:53,739 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:53,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 18:57:53,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 18:57:53,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:53,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:57:53,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:54,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:55,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455467057] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:55,043 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:55,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2022-03-15 18:57:55,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [886916858] [2022-03-15 18:57:55,043 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:55,045 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:55,051 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 102 transitions. [2022-03-15 18:57:55,051 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:56,482 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [201943#(and (or (= ~g2~0 1) (< 0 (+ ~pos~0 2))) (or (= ~g2~0 1) (<= ~pos~0 1)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (< 0 ~pos~0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= (+ ~pos~0 1) 0))), 201891#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 201945#(and (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (+ (- 1) ~d2~0) 0) (= (+ (- 1) ~d1~0) 0) (<= ~pos~0 0) (<= 0 ~pos~0)), 201944#(and (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 1) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 3) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0)) (<= ~pos~0 3) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1)) (< 0 (+ ~pos~0 4))), 201942#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2)))] [2022-03-15 18:57:56,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:57:56,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:56,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:57:56,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=789, Unknown=0, NotChecked=0, Total=992 [2022-03-15 18:57:56,483 INFO L87 Difference]: Start difference. First operand 1886 states and 7832 transitions. Second operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:57,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:57,258 INFO L93 Difference]: Finished difference Result 2255 states and 9071 transitions. [2022-03-15 18:57:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 18:57:57,259 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:57:57,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:57,264 INFO L225 Difference]: With dead ends: 2255 [2022-03-15 18:57:57,264 INFO L226 Difference]: Without dead ends: 2248 [2022-03-15 18:57:57,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 38 SyntacticMatches, 15 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=337, Invalid=1385, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 18:57:57,264 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 157 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:57,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 0 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:57:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2022-03-15 18:57:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 1902. [2022-03-15 18:57:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1901 states have (on average 4.164124145186744) internal successors, (7916), 1901 states have internal predecessors, (7916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 7916 transitions. [2022-03-15 18:57:57,294 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 7916 transitions. Word has length 22 [2022-03-15 18:57:57,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:57,294 INFO L470 AbstractCegarLoop]: Abstraction has 1902 states and 7916 transitions. [2022-03-15 18:57:57,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 7916 transitions. [2022-03-15 18:57:57,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:57:57,298 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:57,298 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:57,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:57,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 18:57:57,514 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:57,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:57,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1636643543, now seen corresponding path program 46 times [2022-03-15 18:57:57,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:57,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448055945] [2022-03-15 18:57:57,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:57,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:57,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:57,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448055945] [2022-03-15 18:57:57,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448055945] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:57,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41432729] [2022-03-15 18:57:57,711 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:57:57,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:57,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:57,724 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:57,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 18:57:57,890 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:57:57,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:57,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:57:57,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:58,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:58,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41432729] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:58,902 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:58,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 23 [2022-03-15 18:57:58,902 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [339841917] [2022-03-15 18:57:58,902 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:58,904 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:58,910 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 116 transitions. [2022-03-15 18:57:58,910 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:00,886 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [208178#(and (not (= 0 (mod ~d3~0 256))) (= (+ (- 1) ~d2~0) 0) (= (+ (- 1) ~d1~0) 0) (<= ~pos~0 0) (<= 0 ~pos~0)), 208177#(and (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 1) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 3) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0)) (<= ~pos~0 3) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1)) (< 0 (+ ~pos~0 4))), 208176#(and (or (not (= 0 (mod ~d3~0 256))) (< 1 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 2) 0)) (<= ~pos~0 2) (< 0 (+ ~pos~0 3)))] [2022-03-15 18:58:00,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 18:58:00,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:00,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 18:58:00,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:58:00,886 INFO L87 Difference]: Start difference. First operand 1902 states and 7916 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:01,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:01,155 INFO L93 Difference]: Finished difference Result 2194 states and 8824 transitions. [2022-03-15 18:58:01,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:58:01,155 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:58:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:01,160 INFO L225 Difference]: With dead ends: 2194 [2022-03-15 18:58:01,160 INFO L226 Difference]: Without dead ends: 2132 [2022-03-15 18:58:01,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:58:01,161 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:01,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:58:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2022-03-15 18:58:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 1930. [2022-03-15 18:58:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 4.165889061689994) internal successors, (8036), 1929 states have internal predecessors, (8036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 8036 transitions. [2022-03-15 18:58:01,193 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 8036 transitions. Word has length 22 [2022-03-15 18:58:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:01,193 INFO L470 AbstractCegarLoop]: Abstraction has 1930 states and 8036 transitions. [2022-03-15 18:58:01,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 8036 transitions. [2022-03-15 18:58:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:58:01,197 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:01,197 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:01,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:01,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:01,411 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:01,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2062472437, now seen corresponding path program 47 times [2022-03-15 18:58:01,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:01,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591908796] [2022-03-15 18:58:01,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:01,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:01,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:01,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591908796] [2022-03-15 18:58:01,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591908796] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:01,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857928018] [2022-03-15 18:58:01,690 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:58:01,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:01,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:01,692 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:01,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 18:58:01,792 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 18:58:01,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:01,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:58:01,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:02,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:03,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857928018] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:03,006 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:03,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 18:58:03,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [220390810] [2022-03-15 18:58:03,006 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:03,008 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:03,014 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 107 transitions. [2022-03-15 18:58:03,014 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:04,518 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [214336#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 214390#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 214387#(and (or (= ~g2~0 1) (< 0 (+ ~pos~0 2))) (or (= ~g2~0 1) (<= ~pos~0 1)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (< 0 ~pos~0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= (+ ~pos~0 1) 0))), 214388#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~d1~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 214391#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g3~0 256) 0))), 214389#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 214392#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 214393#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 214343#(or (not (<= (mod ~g2~0 256) 0)) (not (<= (mod ~g3~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 214386#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2)))] [2022-03-15 18:58:04,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 18:58:04,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:04,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 18:58:04,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=970, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 18:58:04,519 INFO L87 Difference]: Start difference. First operand 1930 states and 8036 transitions. Second operand has 21 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:07,453 INFO L93 Difference]: Finished difference Result 3170 states and 12173 transitions. [2022-03-15 18:58:07,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 18:58:07,454 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:58:07,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:07,460 INFO L225 Difference]: With dead ends: 3170 [2022-03-15 18:58:07,461 INFO L226 Difference]: Without dead ends: 3156 [2022-03-15 18:58:07,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 40 SyntacticMatches, 13 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2512 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1363, Invalid=6119, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 18:58:07,462 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 694 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:07,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [694 Valid, 0 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 18:58:07,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3156 states. [2022-03-15 18:58:07,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3156 to 1964. [2022-03-15 18:58:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1964 states, 1963 states have (on average 4.174732552215996) internal successors, (8195), 1963 states have internal predecessors, (8195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 8195 transitions. [2022-03-15 18:58:07,499 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 8195 transitions. Word has length 22 [2022-03-15 18:58:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:07,499 INFO L470 AbstractCegarLoop]: Abstraction has 1964 states and 8195 transitions. [2022-03-15 18:58:07,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 8195 transitions. [2022-03-15 18:58:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:58:07,502 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:07,502 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:07,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-03-15 18:58:07,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 18:58:07,721 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:07,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:07,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1799141093, now seen corresponding path program 48 times [2022-03-15 18:58:07,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:07,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201778906] [2022-03-15 18:58:07,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:07,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:08,009 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:08,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201778906] [2022-03-15 18:58:08,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201778906] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:08,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872723342] [2022-03-15 18:58:08,009 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:58:08,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:08,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:08,010 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:08,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 18:58:08,119 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 18:58:08,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:08,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 18:58:08,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:08,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:08,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872723342] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:08,944 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:08,944 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 18:58:08,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1368257724] [2022-03-15 18:58:08,945 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:08,946 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:08,953 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 111 transitions. [2022-03-15 18:58:08,953 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:10,142 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [221755#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (= ~g2~0 1) (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 221753#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 221751#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 221750#(and (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 221699#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 221749#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 221752#(and (or (<= ~pos~0 2) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (<= 2 ~pos~0) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0))) (or (not (= (mod ~d1~0 256) 0)) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0))) (or (= ~g2~0 1) (= ~g2~0 0))), 221754#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))))] [2022-03-15 18:58:10,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 18:58:10,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:10,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 18:58:10,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 18:58:10,143 INFO L87 Difference]: Start difference. First operand 1964 states and 8195 transitions. Second operand has 19 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:11,819 INFO L93 Difference]: Finished difference Result 2427 states and 9595 transitions. [2022-03-15 18:58:11,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 18:58:11,819 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:58:11,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:11,824 INFO L225 Difference]: With dead ends: 2427 [2022-03-15 18:58:11,824 INFO L226 Difference]: Without dead ends: 2414 [2022-03-15 18:58:11,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 42 SyntacticMatches, 14 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=993, Invalid=3837, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 18:58:11,825 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 439 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:11,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [439 Valid, 0 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:58:11,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2022-03-15 18:58:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 1990. [2022-03-15 18:58:11,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1989 states have (on average 4.173956762192057) internal successors, (8302), 1989 states have internal predecessors, (8302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 8302 transitions. [2022-03-15 18:58:11,855 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 8302 transitions. Word has length 22 [2022-03-15 18:58:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:11,855 INFO L470 AbstractCegarLoop]: Abstraction has 1990 states and 8302 transitions. [2022-03-15 18:58:11,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 8302 transitions. [2022-03-15 18:58:11,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:58:11,859 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:11,859 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:11,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:12,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:12,076 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:12,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:12,076 INFO L85 PathProgramCache]: Analyzing trace with hash -155669527, now seen corresponding path program 49 times [2022-03-15 18:58:12,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:12,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973356071] [2022-03-15 18:58:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:12,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:12,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:12,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973356071] [2022-03-15 18:58:12,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973356071] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:12,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803420530] [2022-03-15 18:58:12,317 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:58:12,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:12,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:12,324 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:12,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 18:58:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:12,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 18:58:12,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:12,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:13,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803420530] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:13,464 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:13,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 18:58:13,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2108347988] [2022-03-15 18:58:13,464 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:13,466 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:13,473 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 123 transitions. [2022-03-15 18:58:13,473 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:15,208 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [228388#(and (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (= (mod ~g1~0 256) 0))), 228389#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (< 0 (+ ~pos~0 1)))), 228341#(or (not (<= (mod ~g1~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 228390#(and (or (not (= (mod ~g2~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g2~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:58:15,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:58:15,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:15,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:58:15,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:58:15,209 INFO L87 Difference]: Start difference. First operand 1990 states and 8302 transitions. Second operand has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:16,224 INFO L93 Difference]: Finished difference Result 2769 states and 10711 transitions. [2022-03-15 18:58:16,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 18:58:16,224 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:58:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:16,230 INFO L225 Difference]: With dead ends: 2769 [2022-03-15 18:58:16,230 INFO L226 Difference]: Without dead ends: 2750 [2022-03-15 18:58:16,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 40 SyntacticMatches, 24 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=590, Invalid=2272, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 18:58:16,230 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 224 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:16,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 0 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:58:16,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2022-03-15 18:58:16,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 1998. [2022-03-15 18:58:16,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1998 states, 1997 states have (on average 4.175262894341512) internal successors, (8338), 1997 states have internal predecessors, (8338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:16,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 8338 transitions. [2022-03-15 18:58:16,262 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 8338 transitions. Word has length 22 [2022-03-15 18:58:16,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:16,262 INFO L470 AbstractCegarLoop]: Abstraction has 1998 states and 8338 transitions. [2022-03-15 18:58:16,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:16,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 8338 transitions. [2022-03-15 18:58:16,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:58:16,265 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:16,265 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:16,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:16,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-03-15 18:58:16,482 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:16,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:16,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1670218557, now seen corresponding path program 50 times [2022-03-15 18:58:16,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:16,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903525194] [2022-03-15 18:58:16,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:16,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:16,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:16,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903525194] [2022-03-15 18:58:16,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903525194] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:16,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302173488] [2022-03-15 18:58:16,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:58:16,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:16,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:16,748 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:16,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 18:58:16,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:58:16,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:16,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 18:58:16,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:17,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:18,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302173488] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:18,344 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:18,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 18:58:18,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1712149695] [2022-03-15 18:58:18,344 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:18,346 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:18,353 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 116 transitions. [2022-03-15 18:58:18,353 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:19,416 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [235358#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0)))), 235356#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 235357#(and (<= 1 ~pos~0) (<= ~pos~0 3) (or (not (= (mod ~d1~0 256) 0)) (<= 3 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1)) (= (* (div ~d2~0 256) 256) ~d2~0))] [2022-03-15 18:58:19,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:58:19,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:19,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:58:19,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2022-03-15 18:58:19,417 INFO L87 Difference]: Start difference. First operand 1998 states and 8338 transitions. Second operand has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:19,920 INFO L93 Difference]: Finished difference Result 2507 states and 9954 transitions. [2022-03-15 18:58:19,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 18:58:19,920 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:58:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:19,925 INFO L225 Difference]: With dead ends: 2507 [2022-03-15 18:58:19,925 INFO L226 Difference]: Without dead ends: 2500 [2022-03-15 18:58:19,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 18:58:19,926 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:19,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:58:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2022-03-15 18:58:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2026. [2022-03-15 18:58:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 2025 states have (on average 4.183703703703704) internal successors, (8472), 2025 states have internal predecessors, (8472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 8472 transitions. [2022-03-15 18:58:19,958 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 8472 transitions. Word has length 22 [2022-03-15 18:58:19,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:19,958 INFO L470 AbstractCegarLoop]: Abstraction has 2026 states and 8472 transitions. [2022-03-15 18:58:19,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:19,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 8472 transitions. [2022-03-15 18:58:19,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:58:19,961 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:19,961 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:19,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:20,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-03-15 18:58:20,177 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:20,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:20,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1650854751, now seen corresponding path program 51 times [2022-03-15 18:58:20,178 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:20,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338093477] [2022-03-15 18:58:20,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:20,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:20,501 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:20,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338093477] [2022-03-15 18:58:20,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338093477] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:20,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564034949] [2022-03-15 18:58:20,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:58:20,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:20,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:20,503 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:20,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 18:58:20,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 18:58:20,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:20,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 18:58:20,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:21,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:21,835 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:21,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564034949] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:21,835 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:21,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2022-03-15 18:58:21,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [944171671] [2022-03-15 18:58:21,835 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:21,837 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:21,843 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 106 transitions. [2022-03-15 18:58:21,843 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:23,224 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [242088#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 242087#(and (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 242086#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 242092#(and (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0)))), 242089#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 242090#(and (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (= (mod ~g1~0 256) 0))), 242091#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 242093#(and (or (= ~g2~0 1) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (= ~g2~0 1) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 242094#(and (or (= ~g2~0 1) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0)) (= ~g1~0 0)) (or (= ~g2~0 1) (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 242036#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:58:23,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 18:58:23,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:23,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 18:58:23,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 18:58:23,225 INFO L87 Difference]: Start difference. First operand 2026 states and 8472 transitions. Second operand has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:26,388 INFO L93 Difference]: Finished difference Result 3133 states and 11985 transitions. [2022-03-15 18:58:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 18:58:26,389 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:58:26,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:26,395 INFO L225 Difference]: With dead ends: 3133 [2022-03-15 18:58:26,395 INFO L226 Difference]: Without dead ends: 3126 [2022-03-15 18:58:26,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 38 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1523, Invalid=5787, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 18:58:26,396 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 472 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:26,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 0 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:58:26,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2022-03-15 18:58:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 2032. [2022-03-15 18:58:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 2031 states have (on average 4.182668636139833) internal successors, (8495), 2031 states have internal predecessors, (8495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 8495 transitions. [2022-03-15 18:58:26,431 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 8495 transitions. Word has length 22 [2022-03-15 18:58:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:26,432 INFO L470 AbstractCegarLoop]: Abstraction has 2032 states and 8495 transitions. [2022-03-15 18:58:26,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 8495 transitions. [2022-03-15 18:58:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:58:26,435 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:26,435 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:26,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:26,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:26,651 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:26,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:26,651 INFO L85 PathProgramCache]: Analyzing trace with hash 823431103, now seen corresponding path program 52 times [2022-03-15 18:58:26,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:26,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287098588] [2022-03-15 18:58:26,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:26,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:26,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:26,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287098588] [2022-03-15 18:58:26,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287098588] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:26,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201593561] [2022-03-15 18:58:26,949 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:58:26,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:26,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:26,951 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:26,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-15 18:58:27,055 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:58:27,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:27,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:58:27,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:27,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:58:28,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201593561] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:28,184 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:28,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 23 [2022-03-15 18:58:28,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1953135140] [2022-03-15 18:58:28,184 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:28,186 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:28,193 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 124 transitions. [2022-03-15 18:58:28,193 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:29,943 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [249545#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0))), 249546#(and (or (<= 2 ~pos~0) (not (= (mod ~g1~0 256) 0)) (not (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0))) (or (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 0)) (or (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)) (not (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0)))), 249542#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 249543#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 249541#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 249544#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)))] [2022-03-15 18:58:29,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:58:29,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:29,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:58:29,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:58:29,944 INFO L87 Difference]: Start difference. First operand 2032 states and 8495 transitions. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:30,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:30,758 INFO L93 Difference]: Finished difference Result 2833 states and 11270 transitions. [2022-03-15 18:58:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 18:58:30,758 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:58:30,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:30,764 INFO L225 Difference]: With dead ends: 2833 [2022-03-15 18:58:30,764 INFO L226 Difference]: Without dead ends: 2808 [2022-03-15 18:58:30,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=383, Invalid=1597, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 18:58:30,764 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:30,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:58:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2022-03-15 18:58:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2066. [2022-03-15 18:58:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 2065 states have (on average 4.18547215496368) internal successors, (8643), 2065 states have internal predecessors, (8643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 8643 transitions. [2022-03-15 18:58:30,797 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 8643 transitions. Word has length 22 [2022-03-15 18:58:30,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:30,797 INFO L470 AbstractCegarLoop]: Abstraction has 2066 states and 8643 transitions. [2022-03-15 18:58:30,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 8643 transitions. [2022-03-15 18:58:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:58:30,800 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:30,801 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:30,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:31,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-15 18:58:31,003 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:31,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:31,004 INFO L85 PathProgramCache]: Analyzing trace with hash 189154523, now seen corresponding path program 53 times [2022-03-15 18:58:31,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:31,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478709929] [2022-03-15 18:58:31,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:31,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:31,240 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:31,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478709929] [2022-03-15 18:58:31,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478709929] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:31,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882349655] [2022-03-15 18:58:31,240 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:58:31,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:31,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:31,255 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:31,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-15 18:58:31,363 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 18:58:31,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:31,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:58:31,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:31,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:32,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882349655] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:32,482 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:32,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2022-03-15 18:58:32,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1361835459] [2022-03-15 18:58:32,482 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:32,483 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:32,490 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 106 transitions. [2022-03-15 18:58:32,490 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:33,736 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [256696#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g3~0 256) 0))), 256648#(or (not (<= (mod ~g2~0 256) 0)) (not (<= (mod ~g3~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 256692#(and (or (= ~g2~0 1) (< 0 (+ ~pos~0 2))) (or (= ~g2~0 1) (<= ~pos~0 1)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (< 0 ~pos~0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= (+ ~pos~0 1) 0))), 256693#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 256641#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 256691#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 256695#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 256694#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))))] [2022-03-15 18:58:33,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 18:58:33,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:33,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 18:58:33,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:58:33,737 INFO L87 Difference]: Start difference. First operand 2066 states and 8643 transitions. Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:35,362 INFO L93 Difference]: Finished difference Result 3166 states and 12136 transitions. [2022-03-15 18:58:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 18:58:35,363 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:58:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:35,369 INFO L225 Difference]: With dead ends: 3166 [2022-03-15 18:58:35,369 INFO L226 Difference]: Without dead ends: 3144 [2022-03-15 18:58:35,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 41 SyntacticMatches, 15 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=920, Invalid=3502, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 18:58:35,370 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 446 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:35,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 0 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:58:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2022-03-15 18:58:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2148. [2022-03-15 18:58:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 2147 states have (on average 4.181648812296228) internal successors, (8978), 2147 states have internal predecessors, (8978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 8978 transitions. [2022-03-15 18:58:35,407 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 8978 transitions. Word has length 22 [2022-03-15 18:58:35,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:35,408 INFO L470 AbstractCegarLoop]: Abstraction has 2148 states and 8978 transitions. [2022-03-15 18:58:35,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 8978 transitions. [2022-03-15 18:58:35,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:58:35,411 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:35,411 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:35,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:35,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-03-15 18:58:35,627 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:35,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1283246111, now seen corresponding path program 54 times [2022-03-15 18:58:35,628 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:35,628 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497449231] [2022-03-15 18:58:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:35,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:35,932 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:35,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497449231] [2022-03-15 18:58:35,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497449231] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:35,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891068407] [2022-03-15 18:58:35,932 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:58:35,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:35,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:35,948 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:35,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-15 18:58:36,063 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 18:58:36,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:36,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:58:36,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:36,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:37,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891068407] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:37,206 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:37,206 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 18:58:37,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2072940482] [2022-03-15 18:58:37,206 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:37,208 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:37,215 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 120 transitions. [2022-03-15 18:58:37,215 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:38,948 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [264341#(or (not (<= (mod ~g2~0 256) 0)) (not (<= (mod ~g3~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 264387#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 264388#(and (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 264389#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g3~0 256) 0))), 264334#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 264385#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 264386#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g2~0 256) 0)) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g2~0 256) 0)) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 264384#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:58:38,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 18:58:38,948 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:38,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 18:58:38,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 18:58:38,948 INFO L87 Difference]: Start difference. First operand 2148 states and 8978 transitions. Second operand has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:40,519 INFO L93 Difference]: Finished difference Result 2873 states and 11338 transitions. [2022-03-15 18:58:40,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 18:58:40,519 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:58:40,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:40,525 INFO L225 Difference]: With dead ends: 2873 [2022-03-15 18:58:40,525 INFO L226 Difference]: Without dead ends: 2866 [2022-03-15 18:58:40,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 45 SyntacticMatches, 16 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=829, Invalid=3203, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 18:58:40,526 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 459 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:40,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 0 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:58:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2022-03-15 18:58:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 2170. [2022-03-15 18:58:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 4.179806362378977) internal successors, (9066), 2169 states have internal predecessors, (9066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 9066 transitions. [2022-03-15 18:58:40,560 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 9066 transitions. Word has length 22 [2022-03-15 18:58:40,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:40,560 INFO L470 AbstractCegarLoop]: Abstraction has 2170 states and 9066 transitions. [2022-03-15 18:58:40,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:40,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 9066 transitions. [2022-03-15 18:58:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:58:40,564 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:40,564 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:40,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:40,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:40,780 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:40,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:40,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1972970729, now seen corresponding path program 55 times [2022-03-15 18:58:40,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:40,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078031988] [2022-03-15 18:58:40,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:40,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:40,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:40,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:40,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078031988] [2022-03-15 18:58:40,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078031988] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:40,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569076349] [2022-03-15 18:58:40,989 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:58:40,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:40,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:40,990 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:40,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-15 18:58:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:41,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:58:41,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:41,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:41,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569076349] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:41,913 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:41,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 22 [2022-03-15 18:58:41,913 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1934322194] [2022-03-15 18:58:41,913 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:41,915 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:41,921 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 123 transitions. [2022-03-15 18:58:41,922 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:43,242 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [271773#(or (not (<= (mod ~g2~0 256) 0)) (not (<= (mod ~g3~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 271819#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 271817#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 271766#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 271820#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 271815#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 271816#(and (or (= ~g2~0 1) (< 0 (+ ~pos~0 2))) (or (= ~g2~0 1) (<= ~pos~0 1)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (< 0 ~pos~0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= (+ ~pos~0 1) 0))), 271818#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))))] [2022-03-15 18:58:43,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 18:58:43,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:43,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 18:58:43,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:58:43,243 INFO L87 Difference]: Start difference. First operand 2170 states and 9066 transitions. Second operand has 18 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:45,189 INFO L93 Difference]: Finished difference Result 3182 states and 12274 transitions. [2022-03-15 18:58:45,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 18:58:45,189 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:58:45,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:45,195 INFO L225 Difference]: With dead ends: 3182 [2022-03-15 18:58:45,195 INFO L226 Difference]: Without dead ends: 3168 [2022-03-15 18:58:45,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 44 SyntacticMatches, 20 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2297 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1154, Invalid=5166, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 18:58:45,203 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 406 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:45,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 0 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:58:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3168 states. [2022-03-15 18:58:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3168 to 2238. [2022-03-15 18:58:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2238 states, 2237 states have (on average 4.180151989271345) internal successors, (9351), 2237 states have internal predecessors, (9351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 9351 transitions. [2022-03-15 18:58:45,240 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 9351 transitions. Word has length 22 [2022-03-15 18:58:45,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:45,241 INFO L470 AbstractCegarLoop]: Abstraction has 2238 states and 9351 transitions. [2022-03-15 18:58:45,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:45,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 9351 transitions. [2022-03-15 18:58:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:58:45,244 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:45,244 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:45,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:45,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:45,460 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1879097427, now seen corresponding path program 56 times [2022-03-15 18:58:45,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:45,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346590256] [2022-03-15 18:58:45,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:45,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:45,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:45,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346590256] [2022-03-15 18:58:45,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346590256] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:45,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879443434] [2022-03-15 18:58:45,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:58:45,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:45,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:45,677 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:45,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-15 18:58:45,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:58:45,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:45,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 18:58:45,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:46,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:47,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879443434] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:47,227 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:47,227 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2022-03-15 18:58:47,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [132236382] [2022-03-15 18:58:47,227 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:47,228 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:47,235 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 111 transitions. [2022-03-15 18:58:47,235 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:48,765 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [279733#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 279734#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 279735#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 279736#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g3~0 256) 0))), 279737#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)))] [2022-03-15 18:58:48,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:58:48,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:48,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:58:48,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 18:58:48,766 INFO L87 Difference]: Start difference. First operand 2238 states and 9351 transitions. Second operand has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:49,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:49,520 INFO L93 Difference]: Finished difference Result 3047 states and 12111 transitions. [2022-03-15 18:58:49,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:58:49,520 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:58:49,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:49,527 INFO L225 Difference]: With dead ends: 3047 [2022-03-15 18:58:49,527 INFO L226 Difference]: Without dead ends: 3040 [2022-03-15 18:58:49,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=457, Invalid=1799, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 18:58:49,527 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 281 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:49,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 0 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:58:49,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3040 states. [2022-03-15 18:58:49,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3040 to 2286. [2022-03-15 18:58:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2286 states, 2285 states have (on average 4.2065645514223196) internal successors, (9612), 2285 states have internal predecessors, (9612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 9612 transitions. [2022-03-15 18:58:49,588 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 9612 transitions. Word has length 22 [2022-03-15 18:58:49,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:49,588 INFO L470 AbstractCegarLoop]: Abstraction has 2286 states and 9612 transitions. [2022-03-15 18:58:49,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:49,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 9612 transitions. [2022-03-15 18:58:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:58:49,592 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:49,592 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:49,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-03-15 18:58:49,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:49,821 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:49,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:49,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2094529793, now seen corresponding path program 57 times [2022-03-15 18:58:49,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:49,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779806972] [2022-03-15 18:58:49,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:49,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:50,057 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:50,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779806972] [2022-03-15 18:58:50,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779806972] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:50,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854377675] [2022-03-15 18:58:50,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:58:50,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:50,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:50,058 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:50,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-15 18:58:50,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 18:58:50,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:50,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:58:50,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:50,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:51,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854377675] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:51,249 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:51,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2022-03-15 18:58:51,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [981223162] [2022-03-15 18:58:51,249 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:51,251 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:51,258 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 120 transitions. [2022-03-15 18:58:51,258 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:53,788 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [287546#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 287544#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 287547#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 287545#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 287543#(and (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= (mod ~g1~0 256) 0) (<= (+ ~pos~0 1) 0)) (or (= (mod ~g1~0 256) 0) (<= 0 (+ ~pos~0 3)) (= ~g1~0 1)) (or (= (mod ~d1~0 256) 0) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0) (= ~g1~0 1) (<= (+ ~pos~0 3) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (<= (+ ~pos~0 1) 0) (<= 3 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 3) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (<= 3 ~pos~0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0) (<= (+ ~pos~0 1) 0) (= ~g1~0 1)) (or (not (= (mod ~d1~0 256) 0)) (<= 0 (+ ~pos~0 1)) (= (mod ~g1~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g1~0 256) 0) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (= ~g1~0 1))), 287548#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0)) (<= (+ ~pos~0 2) 0)) (or (<= 2 ~pos~0) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= (+ ~pos~0 2) 0)) (or (<= 0 (+ ~pos~0 2)) (not (= (mod ~g3~0 256) 0)))), 287541#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 287542#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:58:53,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 18:58:53,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:53,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 18:58:53,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1004, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 18:58:53,789 INFO L87 Difference]: Start difference. First operand 2286 states and 9612 transitions. Second operand has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:57,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:57,511 INFO L93 Difference]: Finished difference Result 3308 states and 12800 transitions. [2022-03-15 18:58:57,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 18:58:57,511 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:58:57,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:57,519 INFO L225 Difference]: With dead ends: 3308 [2022-03-15 18:58:57,519 INFO L226 Difference]: Without dead ends: 3294 [2022-03-15 18:58:57,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 43 SyntacticMatches, 16 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2135 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1275, Invalid=4731, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 18:58:57,520 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 442 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:57,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [442 Valid, 0 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:58:57,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2022-03-15 18:58:57,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 2296. [2022-03-15 18:58:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2296 states, 2295 states have (on average 4.2030501089324614) internal successors, (9646), 2295 states have internal predecessors, (9646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 9646 transitions. [2022-03-15 18:58:57,562 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 9646 transitions. Word has length 22 [2022-03-15 18:58:57,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:57,562 INFO L470 AbstractCegarLoop]: Abstraction has 2296 states and 9646 transitions. [2022-03-15 18:58:57,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 9646 transitions. [2022-03-15 18:58:57,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:58:57,566 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:57,566 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:57,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:57,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-03-15 18:58:57,782 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:57,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:57,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1226543515, now seen corresponding path program 58 times [2022-03-15 18:58:57,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:57,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473754003] [2022-03-15 18:58:57,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:57,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:58,004 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:58,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473754003] [2022-03-15 18:58:58,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473754003] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:58,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774593829] [2022-03-15 18:58:58,004 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:58:58,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:58,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:58,014 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:58,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-03-15 18:58:58,123 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:58:58,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:58,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 18:58:58,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:58,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:59,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774593829] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:59,180 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:59,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2022-03-15 18:58:59,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [882295272] [2022-03-15 18:58:59,181 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:59,182 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:59,189 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 110 transitions. [2022-03-15 18:58:59,189 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:00,099 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [295689#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 295690#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 295688#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 295687#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:59:00,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:59:00,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:00,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:59:00,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2022-03-15 18:59:00,100 INFO L87 Difference]: Start difference. First operand 2296 states and 9646 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:00,451 INFO L93 Difference]: Finished difference Result 2847 states and 11462 transitions. [2022-03-15 18:59:00,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 18:59:00,451 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:59:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:00,457 INFO L225 Difference]: With dead ends: 2847 [2022-03-15 18:59:00,457 INFO L226 Difference]: Without dead ends: 2840 [2022-03-15 18:59:00,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=1004, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 18:59:00,458 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:00,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:59:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2022-03-15 18:59:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2334. [2022-03-15 18:59:00,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2334 states, 2333 states have (on average 4.216459494213459) internal successors, (9837), 2333 states have internal predecessors, (9837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 9837 transitions. [2022-03-15 18:59:00,497 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 9837 transitions. Word has length 22 [2022-03-15 18:59:00,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:00,497 INFO L470 AbstractCegarLoop]: Abstraction has 2334 states and 9837 transitions. [2022-03-15 18:59:00,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:00,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 9837 transitions. [2022-03-15 18:59:00,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:59:00,501 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:00,501 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:00,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-03-15 18:59:00,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2022-03-15 18:59:00,717 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:00,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:00,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1757538363, now seen corresponding path program 59 times [2022-03-15 18:59:00,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:00,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728716272] [2022-03-15 18:59:00,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:00,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:00,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:00,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728716272] [2022-03-15 18:59:00,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728716272] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:00,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106512088] [2022-03-15 18:59:00,921 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:59:00,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:00,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:00,923 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:00,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-03-15 18:59:01,038 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 18:59:01,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:01,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 18:59:01,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:01,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:59:01,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106512088] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:01,969 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:01,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 20 [2022-03-15 18:59:01,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1364557941] [2022-03-15 18:59:01,969 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:01,971 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:01,978 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 124 transitions. [2022-03-15 18:59:01,978 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:03,276 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [303362#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 303363#(and (<= ~pos~0 4) (or (not (= 0 (mod ~d3~0 256))) (<= 4 ~pos~0)) (= (* (div ~d2~0 256) 256) ~d2~0) (<= 0 ~pos~0) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0)))] [2022-03-15 18:59:03,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 18:59:03,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:03,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 18:59:03,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2022-03-15 18:59:03,277 INFO L87 Difference]: Start difference. First operand 2334 states and 9837 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:03,642 INFO L93 Difference]: Finished difference Result 2707 states and 11132 transitions. [2022-03-15 18:59:03,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 18:59:03,642 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:59:03,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:03,648 INFO L225 Difference]: With dead ends: 2707 [2022-03-15 18:59:03,649 INFO L226 Difference]: Without dead ends: 2700 [2022-03-15 18:59:03,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 17 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:59:03,649 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:03,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:59:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2022-03-15 18:59:03,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2378. [2022-03-15 18:59:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2378 states, 2377 states have (on average 4.22086663862011) internal successors, (10033), 2377 states have internal predecessors, (10033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 10033 transitions. [2022-03-15 18:59:03,689 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 10033 transitions. Word has length 22 [2022-03-15 18:59:03,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:03,689 INFO L470 AbstractCegarLoop]: Abstraction has 2378 states and 10033 transitions. [2022-03-15 18:59:03,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:03,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 10033 transitions. [2022-03-15 18:59:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:59:03,693 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:03,693 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:03,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2022-03-15 18:59:03,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2022-03-15 18:59:03,910 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:03,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:03,910 INFO L85 PathProgramCache]: Analyzing trace with hash 399119867, now seen corresponding path program 60 times [2022-03-15 18:59:03,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:03,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789964345] [2022-03-15 18:59:03,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:03,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:04,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:04,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789964345] [2022-03-15 18:59:04,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789964345] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:04,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69135741] [2022-03-15 18:59:04,191 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:59:04,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:04,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:04,194 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:04,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-03-15 18:59:04,380 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 18:59:04,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:04,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 18:59:04,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:04,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:04,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:05,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69135741] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:05,622 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:05,623 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2022-03-15 18:59:05,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [156087548] [2022-03-15 18:59:05,623 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:05,624 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:05,632 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 128 transitions. [2022-03-15 18:59:05,632 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:08,102 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [310994#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 310999#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0))), 310998#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0) (= ~g3~0 1)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1) (< 0 (+ ~pos~0 1)))), 311000#(and (or (= ~g2~0 1) (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)) (not (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0))) (or (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1) (= ~g3~0 0)) (or (= ~g2~0 1) (<= 2 ~pos~0) (not (= (mod ~g1~0 256) 0)) (not (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0)))), 310997#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 310996#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 310993#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 310995#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 18:59:08,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 18:59:08,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:08,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 18:59:08,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=990, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 18:59:08,103 INFO L87 Difference]: Start difference. First operand 2378 states and 10033 transitions. Second operand has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 19 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:11,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:11,620 INFO L93 Difference]: Finished difference Result 3203 states and 12660 transitions. [2022-03-15 18:59:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 18:59:11,620 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 19 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:59:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:11,627 INFO L225 Difference]: With dead ends: 3203 [2022-03-15 18:59:11,627 INFO L226 Difference]: Without dead ends: 3196 [2022-03-15 18:59:11,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 43 SyntacticMatches, 20 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2315 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1466, Invalid=4696, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 18:59:11,628 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 317 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:11,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 0 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 18:59:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2022-03-15 18:59:11,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 2380. [2022-03-15 18:59:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2379 states have (on average 4.221101303068516) internal successors, (10042), 2379 states have internal predecessors, (10042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 10042 transitions. [2022-03-15 18:59:11,665 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 10042 transitions. Word has length 22 [2022-03-15 18:59:11,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:11,665 INFO L470 AbstractCegarLoop]: Abstraction has 2380 states and 10042 transitions. [2022-03-15 18:59:11,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 19 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 10042 transitions. [2022-03-15 18:59:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:59:11,668 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:11,669 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:11,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-03-15 18:59:11,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:11,871 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:11,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:11,872 INFO L85 PathProgramCache]: Analyzing trace with hash -235156713, now seen corresponding path program 61 times [2022-03-15 18:59:11,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:11,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245267540] [2022-03-15 18:59:11,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:11,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:12,139 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:12,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245267540] [2022-03-15 18:59:12,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245267540] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:12,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26278129] [2022-03-15 18:59:12,139 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:59:12,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:12,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:12,140 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:12,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-03-15 18:59:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:12,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 18:59:12,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:12,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:13,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26278129] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:13,322 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:13,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2022-03-15 18:59:13,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1620748964] [2022-03-15 18:59:13,322 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:13,324 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:13,330 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 110 transitions. [2022-03-15 18:59:13,330 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:14,664 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [319205#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 319154#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 319211#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 319207#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 319206#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 319209#(and (or (= ~g2~0 1) (< 0 (+ ~pos~0 2))) (or (= ~g2~0 1) (<= ~pos~0 1)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (< 0 ~pos~0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= (+ ~pos~0 1) 0))), 319208#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g3~0 256) 0))), 319210#(and (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)))] [2022-03-15 18:59:14,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 18:59:14,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:14,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 18:59:14,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=981, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 18:59:14,665 INFO L87 Difference]: Start difference. First operand 2380 states and 10042 transitions. Second operand has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:16,862 INFO L93 Difference]: Finished difference Result 3700 states and 14306 transitions. [2022-03-15 18:59:16,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 18:59:16,862 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:59:16,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:16,870 INFO L225 Difference]: With dead ends: 3700 [2022-03-15 18:59:16,870 INFO L226 Difference]: Without dead ends: 3686 [2022-03-15 18:59:16,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 38 SyntacticMatches, 16 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1847 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1099, Invalid=4013, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 18:59:16,870 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 464 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:16,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [464 Valid, 0 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:59:16,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2022-03-15 18:59:16,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 2464. [2022-03-15 18:59:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2464 states, 2463 states have (on average 4.2123426715387735) internal successors, (10375), 2463 states have internal predecessors, (10375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 10375 transitions. [2022-03-15 18:59:16,921 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 10375 transitions. Word has length 22 [2022-03-15 18:59:16,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:16,921 INFO L470 AbstractCegarLoop]: Abstraction has 2464 states and 10375 transitions. [2022-03-15 18:59:16,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 10375 transitions. [2022-03-15 18:59:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:59:16,925 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:16,925 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:16,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-03-15 18:59:17,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:17,139 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:17,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:17,140 INFO L85 PathProgramCache]: Analyzing trace with hash 858934875, now seen corresponding path program 62 times [2022-03-15 18:59:17,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:17,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041101262] [2022-03-15 18:59:17,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:17,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:17,331 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:17,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041101262] [2022-03-15 18:59:17,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041101262] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:17,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302056088] [2022-03-15 18:59:17,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:59:17,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:17,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:17,333 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:17,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-03-15 18:59:17,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:59:17,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:17,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 18:59:17,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:17,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:18,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302056088] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:18,645 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:18,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 18:59:18,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1717436603] [2022-03-15 18:59:18,645 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:18,647 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:18,654 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 124 transitions. [2022-03-15 18:59:18,654 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:20,608 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [328066#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g3~0 256) 0))), 328064#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 328065#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)))] [2022-03-15 18:59:20,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:59:20,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:20,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:59:20,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2022-03-15 18:59:20,609 INFO L87 Difference]: Start difference. First operand 2464 states and 10375 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:20,997 INFO L93 Difference]: Finished difference Result 2963 states and 11990 transitions. [2022-03-15 18:59:20,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 18:59:20,997 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:59:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:21,003 INFO L225 Difference]: With dead ends: 2963 [2022-03-15 18:59:21,003 INFO L226 Difference]: Without dead ends: 2956 [2022-03-15 18:59:21,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=811, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 18:59:21,005 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:21,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:59:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2022-03-15 18:59:21,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2502. [2022-03-15 18:59:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2502 states, 2501 states have (on average 4.202718912435026) internal successors, (10511), 2501 states have internal predecessors, (10511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 10511 transitions. [2022-03-15 18:59:21,045 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 10511 transitions. Word has length 22 [2022-03-15 18:59:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:21,045 INFO L470 AbstractCegarLoop]: Abstraction has 2502 states and 10511 transitions. [2022-03-15 18:59:21,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 10511 transitions. [2022-03-15 18:59:21,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:59:21,049 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:21,049 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:21,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-03-15 18:59:21,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-03-15 18:59:21,266 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:21,266 INFO L85 PathProgramCache]: Analyzing trace with hash -445851585, now seen corresponding path program 63 times [2022-03-15 18:59:21,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:21,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389793454] [2022-03-15 18:59:21,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:21,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:21,564 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:21,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389793454] [2022-03-15 18:59:21,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389793454] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:21,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904642736] [2022-03-15 18:59:21,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:59:21,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:21,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:21,565 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:21,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-03-15 18:59:21,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 18:59:21,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:21,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 18:59:21,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:22,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:22,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904642736] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:22,683 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:22,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 23 [2022-03-15 18:59:22,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1644071267] [2022-03-15 18:59:22,683 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:22,684 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:22,693 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 145 transitions. [2022-03-15 18:59:22,693 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:25,797 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [336193#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 336201#(and (or (= 0 (mod ~d3~0 256)) (= ~g2~0 0) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 0) (<= 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (<= 6 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0)) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 6) (= ~g2~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g3~0 256) 0))), 336194#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 336200#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1) (= ~g3~0 0)) (or (= ~g2~0 1) (<= 2 ~pos~0) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 0)) (or (= ~g2~0 1) (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 0)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1) (not (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0)))), 336198#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 336196#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 336195#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 336199#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0) (= ~g3~0 1)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1) (< 0 (+ ~pos~0 1)))), 336197#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0)))] [2022-03-15 18:59:25,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 18:59:25,797 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:25,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 18:59:25,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=935, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 18:59:25,797 INFO L87 Difference]: Start difference. First operand 2502 states and 10511 transitions. Second operand has 21 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:31,754 INFO L93 Difference]: Finished difference Result 3963 states and 15168 transitions. [2022-03-15 18:59:31,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 18:59:31,754 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:59:31,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:31,763 INFO L225 Difference]: With dead ends: 3963 [2022-03-15 18:59:31,763 INFO L226 Difference]: Without dead ends: 3956 [2022-03-15 18:59:31,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 49 SyntacticMatches, 24 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3394 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1929, Invalid=8577, Unknown=0, NotChecked=0, Total=10506 [2022-03-15 18:59:31,765 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 394 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:31,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 0 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 18:59:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2022-03-15 18:59:31,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 2512. [2022-03-15 18:59:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2512 states, 2511 states have (on average 4.199920350457985) internal successors, (10546), 2511 states have internal predecessors, (10546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 10546 transitions. [2022-03-15 18:59:31,814 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 10546 transitions. Word has length 22 [2022-03-15 18:59:31,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:31,814 INFO L470 AbstractCegarLoop]: Abstraction has 2512 states and 10546 transitions. [2022-03-15 18:59:31,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 10546 transitions. [2022-03-15 18:59:31,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:59:31,818 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:31,818 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:31,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-03-15 18:59:32,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-03-15 18:59:32,020 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:32,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:32,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1703906327, now seen corresponding path program 64 times [2022-03-15 18:59:32,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:32,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095123533] [2022-03-15 18:59:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:32,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:32,219 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:32,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095123533] [2022-03-15 18:59:32,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095123533] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:32,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142429794] [2022-03-15 18:59:32,219 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:59:32,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:32,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:32,220 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:32,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-03-15 18:59:32,338 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:59:32,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:32,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 18:59:32,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:32,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:32,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:33,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142429794] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:33,188 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:33,188 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 18:59:33,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1756325776] [2022-03-15 18:59:33,189 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:33,190 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:33,198 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 137 transitions. [2022-03-15 18:59:33,198 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:35,339 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [345485#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 345481#(and (or (not (= (mod ~g2~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g2~0 256) 0)) (< 0 (+ ~pos~0 1)))), 345480#(and (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (< 0 (+ ~pos~0 2)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (= (mod ~g3~0 256) 0))), 345435#(or (not (<= (mod ~g3~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 345479#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g3~0 256) 0))), 345483#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g2~0 256) 0)) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g2~0 256) 0)) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 345482#(and (or (not (= (mod ~g2~0 256) 0)) (< 0 (mod ~g3~0 256)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g2~0 256) 0)) (< 0 (mod ~g3~0 256)) (<= ~pos~0 0))), 345484#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 345478#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)))] [2022-03-15 18:59:35,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 18:59:35,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:35,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 18:59:35,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=843, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 18:59:35,339 INFO L87 Difference]: Start difference. First operand 2512 states and 10546 transitions. Second operand has 20 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:37,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:37,174 INFO L93 Difference]: Finished difference Result 4495 states and 18088 transitions. [2022-03-15 18:59:37,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 18:59:37,184 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:59:37,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:37,194 INFO L225 Difference]: With dead ends: 4495 [2022-03-15 18:59:37,194 INFO L226 Difference]: Without dead ends: 4488 [2022-03-15 18:59:37,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 47 SyntacticMatches, 22 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=709, Invalid=3073, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 18:59:37,195 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 452 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:37,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 0 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:59:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4488 states. [2022-03-15 18:59:37,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4488 to 2610. [2022-03-15 18:59:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2609 states have (on average 4.178229206592564) internal successors, (10901), 2609 states have internal predecessors, (10901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 10901 transitions. [2022-03-15 18:59:37,251 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 10901 transitions. Word has length 22 [2022-03-15 18:59:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:37,251 INFO L470 AbstractCegarLoop]: Abstraction has 2610 states and 10901 transitions. [2022-03-15 18:59:37,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 10901 transitions. [2022-03-15 18:59:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 18:59:37,256 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:37,256 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:37,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-03-15 18:59:37,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:37,470 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:37,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash -162537528, now seen corresponding path program 65 times [2022-03-15 18:59:37,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:37,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344417408] [2022-03-15 18:59:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:37,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 18:59:37,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:37,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344417408] [2022-03-15 18:59:37,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344417408] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:37,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193912471] [2022-03-15 18:59:37,539 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:59:37,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:37,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:37,540 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:37,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-03-15 18:59:37,657 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 18:59:37,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:37,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 18:59:37,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 18:59:37,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 18:59:38,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193912471] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:38,015 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:38,015 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 18:59:38,015 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1376653028] [2022-03-15 18:59:38,015 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:38,016 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:38,028 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 206 transitions. [2022-03-15 18:59:38,028 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:40,595 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:59:40,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 18:59:40,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:40,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 18:59:40,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-03-15 18:59:40,596 INFO L87 Difference]: Start difference. First operand 2610 states and 10901 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:40,664 INFO L93 Difference]: Finished difference Result 2760 states and 11095 transitions. [2022-03-15 18:59:40,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 18:59:40,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 18:59:40,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:40,669 INFO L225 Difference]: With dead ends: 2760 [2022-03-15 18:59:40,669 INFO L226 Difference]: Without dead ends: 2744 [2022-03-15 18:59:40,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 59 SyntacticMatches, 56 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-03-15 18:59:40,670 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:40,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 18:59:40,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2022-03-15 18:59:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 2200. [2022-03-15 18:59:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2200 states, 2199 states have (on average 4.050022737608003) internal successors, (8906), 2199 states have internal predecessors, (8906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 8906 transitions. [2022-03-15 18:59:40,705 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 8906 transitions. Word has length 23 [2022-03-15 18:59:40,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:40,705 INFO L470 AbstractCegarLoop]: Abstraction has 2200 states and 8906 transitions. [2022-03-15 18:59:40,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:40,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 8906 transitions. [2022-03-15 18:59:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 18:59:40,708 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:40,708 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:40,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-03-15 18:59:40,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-03-15 18:59:40,915 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:40,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:40,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1377922432, now seen corresponding path program 66 times [2022-03-15 18:59:40,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:40,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237782678] [2022-03-15 18:59:40,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:40,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 18:59:40,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:40,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237782678] [2022-03-15 18:59:40,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237782678] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:40,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516436924] [2022-03-15 18:59:40,988 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:59:40,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:40,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:40,996 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:40,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-03-15 18:59:41,121 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 18:59:41,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:41,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 18:59:41,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:41,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:59:41,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:59:41,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516436924] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:41,352 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:41,352 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-03-15 18:59:41,352 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1871943199] [2022-03-15 18:59:41,352 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:41,353 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:41,362 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 136 transitions. [2022-03-15 18:59:41,362 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:42,609 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [362712#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1))), 362618#(< (div (+ 255 (* (- 1) ~g1~0)) (- 256)) (div (* (- 1) ~g1~0) (- 256))), 362713#(and (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)))] [2022-03-15 18:59:42,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:59:42,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:42,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:59:42,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-03-15 18:59:42,610 INFO L87 Difference]: Start difference. First operand 2200 states and 8906 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:42,711 INFO L93 Difference]: Finished difference Result 2316 states and 8872 transitions. [2022-03-15 18:59:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 18:59:42,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 18:59:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:42,716 INFO L225 Difference]: With dead ends: 2316 [2022-03-15 18:59:42,716 INFO L226 Difference]: Without dead ends: 2306 [2022-03-15 18:59:42,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 72 SyntacticMatches, 12 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-03-15 18:59:42,717 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:42,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:59:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2022-03-15 18:59:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1636. [2022-03-15 18:59:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1635 states have (on average 3.7896024464831806) internal successors, (6196), 1635 states have internal predecessors, (6196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 6196 transitions. [2022-03-15 18:59:42,743 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 6196 transitions. Word has length 23 [2022-03-15 18:59:42,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:42,743 INFO L470 AbstractCegarLoop]: Abstraction has 1636 states and 6196 transitions. [2022-03-15 18:59:42,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 6196 transitions. [2022-03-15 18:59:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:59:42,746 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:42,746 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:42,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-03-15 18:59:42,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-03-15 18:59:42,962 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:42,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:42,963 INFO L85 PathProgramCache]: Analyzing trace with hash 715463773, now seen corresponding path program 67 times [2022-03-15 18:59:42,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:42,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770748378] [2022-03-15 18:59:42,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:42,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:43,206 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:43,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770748378] [2022-03-15 18:59:43,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770748378] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:43,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51264336] [2022-03-15 18:59:43,207 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:59:43,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:43,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:43,208 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:43,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-03-15 18:59:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:43,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 18:59:43,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:59:43,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:59:44,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51264336] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:44,523 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:44,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2022-03-15 18:59:44,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [941788280] [2022-03-15 18:59:44,524 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:44,525 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:44,539 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 236 transitions. [2022-03-15 18:59:44,540 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:49,873 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [368479#(and (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (<= 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g3~0 256) 0))), 368473#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 368478#(and (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0)) (or (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g3~0 256) 0)))), 368481#(and (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (= ~g2~0 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 0) (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= ~g2~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= ~g2~0 0) (= (mod ~g3~0 256) 0))), 368474#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 368475#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (<= 2 ~pos~0) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= (+ ~pos~0 2) 0)) (or (<= 0 (+ ~pos~0 2)) (not (= (mod ~g3~0 256) 0)))), 368477#(and (or (<= ~d2~0 (* (div ~d2~0 256) 256)) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (< 0 (+ (div ~d2~0 256) 1)) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)))), 368480#(and (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 0) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 0) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0))), 368482#(and (= ~d2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (= ~g3~0 ~g2~0) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)) (= ~g3~0 1)), 368476#(and (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0)) (or (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 0) (<= (div ~d2~0 256) 0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)) (<= 1 ~d2~0)))] [2022-03-15 18:59:49,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 18:59:49,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:49,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 18:59:49,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1294, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 18:59:49,874 INFO L87 Difference]: Start difference. First operand 1636 states and 6196 transitions. Second operand has 23 states, 22 states have (on average 4.7727272727272725) internal successors, (105), 22 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:53,016 INFO L93 Difference]: Finished difference Result 3440 states and 12169 transitions. [2022-03-15 18:59:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 18:59:53,016 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.7727272727272725) internal successors, (105), 22 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 18:59:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:53,022 INFO L225 Difference]: With dead ends: 3440 [2022-03-15 18:59:53,023 INFO L226 Difference]: Without dead ends: 3405 [2022-03-15 18:59:53,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 80 SyntacticMatches, 25 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2713 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1348, Invalid=5624, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 18:59:53,024 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 345 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:53,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 0 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 18:59:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2022-03-15 18:59:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 1782. [2022-03-15 18:59:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1781 states have (on average 3.8220101066816397) internal successors, (6807), 1781 states have internal predecessors, (6807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 6807 transitions. [2022-03-15 18:59:53,056 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 6807 transitions. Word has length 24 [2022-03-15 18:59:53,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:53,056 INFO L470 AbstractCegarLoop]: Abstraction has 1782 states and 6807 transitions. [2022-03-15 18:59:53,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.7727272727272725) internal successors, (105), 22 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:53,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 6807 transitions. [2022-03-15 18:59:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:59:53,059 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:53,059 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:53,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-03-15 18:59:53,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-03-15 18:59:53,273 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:53,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:53,273 INFO L85 PathProgramCache]: Analyzing trace with hash -98934667, now seen corresponding path program 68 times [2022-03-15 18:59:53,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:53,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142338026] [2022-03-15 18:59:53,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:53,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:53,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:53,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142338026] [2022-03-15 18:59:53,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142338026] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:53,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272370433] [2022-03-15 18:59:53,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:59:53,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:53,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:53,631 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:53,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-03-15 18:59:53,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:59:53,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:53,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 18:59:53,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:54,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:54,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272370433] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:54,829 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:54,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 18:59:54,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1416099340] [2022-03-15 18:59:54,829 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:54,830 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:54,843 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 182 transitions. [2022-03-15 18:59:54,843 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:59,389 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [375751#(and (or (not (= (mod ~g1~0 256) 0)) (= ~g3~0 0) (<= 0 ~pos~0)) (or (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1) (= ~g3~0 0)) (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g1~0 256) 0))) (or (not (= (mod ~g1~0 256) 0)) (not (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0))) (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0) (= ~g3~0 0))), 375752#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= 2 ~pos~0) (= (mod ~g3~0 256) 0))), 375755#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 375753#(and (or (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (<= 2 ~pos~0) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0))), 375761#(and (or (= (mod ~d1~0 256) 0) (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~d2~0 1) (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (= ~g3~0 1)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0))), 375748#(and (or (not (= (mod ~g1~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1)) (or (<= 2 ~pos~0) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1))), 375744#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 375756#(and (or (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~g1~0 256) 0)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0))), 375747#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 375758#(and (or (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0))), 375759#(and (or (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (= ~g3~0 1)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (= (mod ~g1~0 256) 0))), 375757#(and (or (not (= (mod ~g1~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (= (+ (- 1) ~d3~0) 0) (not (= (mod ~g1~0 256) 0))) (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g1~0 256) 0))) (or (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1))), 375745#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 375746#(and (or (not (= (mod ~g1~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (<= 2 ~pos~0) (not (= (mod ~g1~0 256) 0))) (or (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)))), 375760#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0))), 375749#(and (or (not (= (mod ~g1~0 256) 0)) (= ~g3~0 0) (<= 4 ~pos~0)) (or (<= ~pos~0 4) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 0)) (or (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1) (= ~g3~0 0)) (or (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1) (not (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0))) (or (not (= (mod ~g1~0 256) 0)) (= ~g3~0 0) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0))), 375754#(and (or (<= 2 ~pos~0) (not (= (mod ~g1~0 256) 0)) (not (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0))) (or (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 0)) (or (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1) (not (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0))) (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g1~0 256) 0))) (or (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 0))), 375750#(and (or (<= 2 ~pos~0) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 0)) (or (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1) (= ~g3~0 0)) (or (not (= (mod ~g1~0 256) 0)) (= ~g3~0 0) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (not (= (mod ~g1~0 256) 0)) (not (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0))) (or (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 0)))] [2022-03-15 18:59:59,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 18:59:59,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:59,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 18:59:59,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=2152, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 18:59:59,390 INFO L87 Difference]: Start difference. First operand 1782 states and 6807 transitions. Second operand has 31 states, 30 states have (on average 3.533333333333333) internal successors, (106), 30 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:04,889 INFO L93 Difference]: Finished difference Result 3960 states and 13939 transitions. [2022-03-15 19:00:04,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 19:00:04,889 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.533333333333333) internal successors, (106), 30 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:00:04,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:04,896 INFO L225 Difference]: With dead ends: 3960 [2022-03-15 19:00:04,896 INFO L226 Difference]: Without dead ends: 3848 [2022-03-15 19:00:04,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 62 SyntacticMatches, 15 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5329 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2445, Invalid=13055, Unknown=0, NotChecked=0, Total=15500 [2022-03-15 19:00:04,897 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 867 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 2566 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 2566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:04,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [867 Valid, 0 Invalid, 3051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 2566 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:00:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3848 states. [2022-03-15 19:00:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3848 to 1808. [2022-03-15 19:00:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 3.8206972883231876) internal successors, (6904), 1807 states have internal predecessors, (6904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 6904 transitions. [2022-03-15 19:00:04,931 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 6904 transitions. Word has length 24 [2022-03-15 19:00:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:04,931 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 6904 transitions. [2022-03-15 19:00:04,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.533333333333333) internal successors, (106), 30 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 6904 transitions. [2022-03-15 19:00:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:00:04,933 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:04,934 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:04,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-03-15 19:00:05,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable70 [2022-03-15 19:00:05,139 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:05,139 INFO L85 PathProgramCache]: Analyzing trace with hash 764697031, now seen corresponding path program 69 times [2022-03-15 19:00:05,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:05,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010576551] [2022-03-15 19:00:05,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:05,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:05,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:05,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010576551] [2022-03-15 19:00:05,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010576551] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:05,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39200255] [2022-03-15 19:00:05,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:00:05,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:05,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:05,378 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:05,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-03-15 19:00:05,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:00:05,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:00:05,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:00:05,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:06,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:07,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39200255] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:07,111 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:07,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2022-03-15 19:00:07,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [937594895] [2022-03-15 19:00:07,111 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:07,112 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:07,125 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 186 transitions. [2022-03-15 19:00:07,125 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:12,954 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [383654#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 383656#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= 2 ~pos~0) (= (mod ~g3~0 256) 0))), 383655#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 383657#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 383659#(and (= ~d2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)) (= ~g3~0 1)), 383658#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:00:12,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:00:12,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:12,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:00:12,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=991, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:00:12,955 INFO L87 Difference]: Start difference. First operand 1808 states and 6904 transitions. Second operand has 18 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:13,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:13,796 INFO L93 Difference]: Finished difference Result 2434 states and 9073 transitions. [2022-03-15 19:00:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:00:13,796 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:00:13,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:13,801 INFO L225 Difference]: With dead ends: 2434 [2022-03-15 19:00:13,801 INFO L226 Difference]: Without dead ends: 2398 [2022-03-15 19:00:13,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 57 SyntacticMatches, 36 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=455, Invalid=1615, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:00:13,802 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:13,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:00:13,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2022-03-15 19:00:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 1978. [2022-03-15 19:00:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1978 states, 1977 states have (on average 3.8654527061203843) internal successors, (7642), 1977 states have internal predecessors, (7642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 7642 transitions. [2022-03-15 19:00:13,831 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 7642 transitions. Word has length 24 [2022-03-15 19:00:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:13,831 INFO L470 AbstractCegarLoop]: Abstraction has 1978 states and 7642 transitions. [2022-03-15 19:00:13,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 7642 transitions. [2022-03-15 19:00:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:00:13,834 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:13,834 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:13,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-03-15 19:00:14,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:14,038 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:14,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:14,038 INFO L85 PathProgramCache]: Analyzing trace with hash 928454877, now seen corresponding path program 70 times [2022-03-15 19:00:14,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:14,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867250711] [2022-03-15 19:00:14,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:14,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:14,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:14,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867250711] [2022-03-15 19:00:14,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867250711] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:14,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966982550] [2022-03-15 19:00:14,316 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:00:14,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:14,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:14,317 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:14,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-03-15 19:00:14,441 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:00:14,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:00:14,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:00:14,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:00:14,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:00:15,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966982550] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:15,735 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:15,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2022-03-15 19:00:15,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1429689667] [2022-03-15 19:00:15,736 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:15,738 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:15,752 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 182 transitions. [2022-03-15 19:00:15,752 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:21,124 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [390237#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 390238#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 390239#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 390240#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (<= 5 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 5) (= (mod ~g3~0 256) 0))), 390241#(and (= ~d2~0 1) (= ~g2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)) (= ~g3~0 1))] [2022-03-15 19:00:21,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:00:21,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:21,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:00:21,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=934, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:00:21,125 INFO L87 Difference]: Start difference. First operand 1978 states and 7642 transitions. Second operand has 18 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:22,017 INFO L93 Difference]: Finished difference Result 2247 states and 8536 transitions. [2022-03-15 19:00:22,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:00:22,018 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:00:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:22,022 INFO L225 Difference]: With dead ends: 2247 [2022-03-15 19:00:22,022 INFO L226 Difference]: Without dead ends: 2240 [2022-03-15 19:00:22,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 52 SyntacticMatches, 42 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=342, Invalid=1914, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:00:22,022 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:22,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:00:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2022-03-15 19:00:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1990. [2022-03-15 19:00:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1989 states have (on average 3.8587229763700353) internal successors, (7675), 1989 states have internal predecessors, (7675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 7675 transitions. [2022-03-15 19:00:22,050 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 7675 transitions. Word has length 24 [2022-03-15 19:00:22,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:22,050 INFO L470 AbstractCegarLoop]: Abstraction has 1990 states and 7675 transitions. [2022-03-15 19:00:22,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:22,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 7675 transitions. [2022-03-15 19:00:22,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:00:22,053 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:22,053 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:22,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-03-15 19:00:22,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:22,269 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:22,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1792086575, now seen corresponding path program 71 times [2022-03-15 19:00:22,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:22,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058412673] [2022-03-15 19:00:22,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:22,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:22,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:22,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058412673] [2022-03-15 19:00:22,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058412673] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:22,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621096713] [2022-03-15 19:00:22,514 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:00:22,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:22,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:22,515 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:22,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-03-15 19:00:22,647 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:00:22,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:00:22,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:00:22,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:23,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:24,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621096713] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:24,415 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:24,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 27 [2022-03-15 19:00:24,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [820245041] [2022-03-15 19:00:24,415 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:24,417 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:24,430 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 186 transitions. [2022-03-15 19:00:24,430 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:31,236 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [396666#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 396664#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 396667#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (<= 5 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 5) (= (mod ~g3~0 256) 0))), 396665#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 396668#(and (= ~d2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)) (= ~g3~0 1))] [2022-03-15 19:00:31,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:00:31,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:31,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:00:31,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:00:31,236 INFO L87 Difference]: Start difference. First operand 1990 states and 7675 transitions. Second operand has 17 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:33,479 INFO L93 Difference]: Finished difference Result 3082 states and 11253 transitions. [2022-03-15 19:00:33,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:00:33,480 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:00:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:33,485 INFO L225 Difference]: With dead ends: 3082 [2022-03-15 19:00:33,486 INFO L226 Difference]: Without dead ends: 2998 [2022-03-15 19:00:33,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 58 SyntacticMatches, 37 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=602, Invalid=2820, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:00:33,486 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:33,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:00:33,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2022-03-15 19:00:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2078. [2022-03-15 19:00:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 2077 states have (on average 3.8791526239768896) internal successors, (8057), 2077 states have internal predecessors, (8057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 8057 transitions. [2022-03-15 19:00:33,518 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 8057 transitions. Word has length 24 [2022-03-15 19:00:33,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:33,518 INFO L470 AbstractCegarLoop]: Abstraction has 2078 states and 8057 transitions. [2022-03-15 19:00:33,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 8057 transitions. [2022-03-15 19:00:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:00:33,522 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:33,522 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:33,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2022-03-15 19:00:33,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:33,738 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:33,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:33,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1382728995, now seen corresponding path program 72 times [2022-03-15 19:00:33,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:33,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395019432] [2022-03-15 19:00:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:33,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:34,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:34,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395019432] [2022-03-15 19:00:34,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395019432] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:34,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836329180] [2022-03-15 19:00:34,017 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:00:34,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:34,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:34,018 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:34,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-03-15 19:00:34,181 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:00:34,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:00:34,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:00:34,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:00:34,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:00:35,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836329180] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:35,467 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:35,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 19:00:35,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1529962595] [2022-03-15 19:00:35,467 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:35,469 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:35,483 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 218 transitions. [2022-03-15 19:00:35,483 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:41,177 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [404126#(and (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (<= ~pos~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1))), 404125#(and (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 404127#(and (= ~g2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)))] [2022-03-15 19:00:41,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:00:41,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:41,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:00:41,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:00:41,177 INFO L87 Difference]: Start difference. First operand 2078 states and 8057 transitions. Second operand has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:41,684 INFO L93 Difference]: Finished difference Result 2865 states and 10555 transitions. [2022-03-15 19:00:41,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:00:41,684 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:00:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:41,689 INFO L225 Difference]: With dead ends: 2865 [2022-03-15 19:00:41,689 INFO L226 Difference]: Without dead ends: 2822 [2022-03-15 19:00:41,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 45 SyntacticMatches, 61 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2219 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=461, Invalid=1519, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:00:41,692 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:41,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:00:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2022-03-15 19:00:41,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2090. [2022-03-15 19:00:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 2089 states have (on average 3.8707515557683103) internal successors, (8086), 2089 states have internal predecessors, (8086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 8086 transitions. [2022-03-15 19:00:41,726 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 8086 transitions. Word has length 24 [2022-03-15 19:00:41,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:41,726 INFO L470 AbstractCegarLoop]: Abstraction has 2090 states and 8086 transitions. [2022-03-15 19:00:41,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 8086 transitions. [2022-03-15 19:00:41,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:00:41,730 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:41,730 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:41,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-03-15 19:00:41,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2022-03-15 19:00:41,947 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:41,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:41,947 INFO L85 PathProgramCache]: Analyzing trace with hash 302681579, now seen corresponding path program 73 times [2022-03-15 19:00:41,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:41,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100329225] [2022-03-15 19:00:41,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:41,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:42,217 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:42,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100329225] [2022-03-15 19:00:42,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100329225] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:42,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114093207] [2022-03-15 19:00:42,218 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:00:42,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:42,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:42,219 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:42,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-03-15 19:00:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:42,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:00:42,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:43,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:00:43,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114093207] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:43,982 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:43,982 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 29 [2022-03-15 19:00:43,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [763000724] [2022-03-15 19:00:43,982 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:43,984 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:43,998 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 208 transitions. [2022-03-15 19:00:43,998 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:50,290 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [411366#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 411371#(and (= ~d2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)) (= ~g3~0 1)), 411369#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 411367#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 411370#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0))), 411368#(and (or (= 0 (mod ~d3~0 256)) (< 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:00:50,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:00:50,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:50,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:00:50,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1030, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:00:50,291 INFO L87 Difference]: Start difference. First operand 2090 states and 8086 transitions. Second operand has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:51,002 INFO L93 Difference]: Finished difference Result 2667 states and 10045 transitions. [2022-03-15 19:00:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:00:51,002 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:00:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:51,008 INFO L225 Difference]: With dead ends: 2667 [2022-03-15 19:00:51,008 INFO L226 Difference]: Without dead ends: 2624 [2022-03-15 19:00:51,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 65 SyntacticMatches, 35 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=477, Invalid=1685, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:00:51,008 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 132 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:51,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 0 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:00:51,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2022-03-15 19:00:51,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2104. [2022-03-15 19:00:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2104 states, 2103 states have (on average 3.8730385164051353) internal successors, (8145), 2103 states have internal predecessors, (8145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 8145 transitions. [2022-03-15 19:00:51,038 INFO L78 Accepts]: Start accepts. Automaton has 2104 states and 8145 transitions. Word has length 24 [2022-03-15 19:00:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:51,039 INFO L470 AbstractCegarLoop]: Abstraction has 2104 states and 8145 transitions. [2022-03-15 19:00:51,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 8145 transitions. [2022-03-15 19:00:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:00:51,042 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:51,042 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:51,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-03-15 19:00:51,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:51,255 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash -361355345, now seen corresponding path program 74 times [2022-03-15 19:00:51,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:51,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164860057] [2022-03-15 19:00:51,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:51,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:51,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164860057] [2022-03-15 19:00:51,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164860057] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:51,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827376901] [2022-03-15 19:00:51,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:00:51,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:51,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:51,570 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:51,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-03-15 19:00:51,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:00:51,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:00:51,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:00:51,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:52,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:00:53,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827376901] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:53,312 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:53,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2022-03-15 19:00:53,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [972582047] [2022-03-15 19:00:53,312 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:53,314 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:53,327 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 200 transitions. [2022-03-15 19:00:53,327 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:57,732 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [418437#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (<= 5 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 5) (= (mod ~g3~0 256) 0))), 418434#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 418436#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 418438#(and (= ~d2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)) (= ~g3~0 1)), 418435#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))))] [2022-03-15 19:00:57,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:00:57,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:57,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:00:57,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=921, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:00:57,732 INFO L87 Difference]: Start difference. First operand 2104 states and 8145 transitions. Second operand has 17 states, 16 states have (on average 4.9375) internal successors, (79), 16 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:58,383 INFO L93 Difference]: Finished difference Result 2460 states and 9286 transitions. [2022-03-15 19:00:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:00:58,383 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.9375) internal successors, (79), 16 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:00:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:58,388 INFO L225 Difference]: With dead ends: 2460 [2022-03-15 19:00:58,388 INFO L226 Difference]: Without dead ends: 2434 [2022-03-15 19:00:58,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 57 SyntacticMatches, 42 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=326, Invalid=1654, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:00:58,388 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:58,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:00:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2022-03-15 19:00:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2144. [2022-03-15 19:00:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 2143 states have (on average 3.8800746616892208) internal successors, (8315), 2143 states have internal predecessors, (8315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 8315 transitions. [2022-03-15 19:00:58,422 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 8315 transitions. Word has length 24 [2022-03-15 19:00:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:58,423 INFO L470 AbstractCegarLoop]: Abstraction has 2144 states and 8315 transitions. [2022-03-15 19:00:58,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.9375) internal successors, (79), 16 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:58,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 8315 transitions. [2022-03-15 19:00:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:00:58,426 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:58,426 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:58,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-03-15 19:00:58,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:58,628 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:58,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash 641423517, now seen corresponding path program 75 times [2022-03-15 19:00:58,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:58,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327549774] [2022-03-15 19:00:58,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:58,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:58,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:58,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327549774] [2022-03-15 19:00:58,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327549774] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:58,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427480512] [2022-03-15 19:00:58,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:00:58,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:58,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:58,886 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:58,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-03-15 19:00:59,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:00:59,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:00:59,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:00:59,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:59,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:00,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427480512] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:00,238 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:00,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-03-15 19:01:00,238 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1444187925] [2022-03-15 19:01:00,238 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:00,239 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:00,252 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 182 transitions. [2022-03-15 19:01:00,252 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:07,516 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [425382#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 425384#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0))), 425381#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 425383#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 425385#(and (= ~d2~0 1) (= ~g2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)) (= ~g3~0 1))] [2022-03-15 19:01:07,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:01:07,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:07,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:01:07,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:01:07,516 INFO L87 Difference]: Start difference. First operand 2144 states and 8315 transitions. Second operand has 18 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:08,149 INFO L93 Difference]: Finished difference Result 2297 states and 8806 transitions. [2022-03-15 19:01:08,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:01:08,149 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:01:08,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:08,154 INFO L225 Difference]: With dead ends: 2297 [2022-03-15 19:01:08,154 INFO L226 Difference]: Without dead ends: 2284 [2022-03-15 19:01:08,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 47 SyntacticMatches, 42 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=490, Invalid=1862, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:01:08,155 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:08,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:01:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2022-03-15 19:01:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2160. [2022-03-15 19:01:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2160 states, 2159 states have (on average 3.871699861046781) internal successors, (8359), 2159 states have internal predecessors, (8359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 8359 transitions. [2022-03-15 19:01:08,187 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 8359 transitions. Word has length 24 [2022-03-15 19:01:08,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:08,187 INFO L470 AbstractCegarLoop]: Abstraction has 2160 states and 8359 transitions. [2022-03-15 19:01:08,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 8359 transitions. [2022-03-15 19:01:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:01:08,191 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:08,191 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:08,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-03-15 19:01:08,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-03-15 19:01:08,408 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:08,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:08,408 INFO L85 PathProgramCache]: Analyzing trace with hash 349864067, now seen corresponding path program 76 times [2022-03-15 19:01:08,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:08,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832358893] [2022-03-15 19:01:08,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:08,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:08,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:08,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832358893] [2022-03-15 19:01:08,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832358893] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:08,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087220551] [2022-03-15 19:01:08,650 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:01:08,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:08,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:08,651 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:08,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-03-15 19:01:08,782 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:01:08,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:01:08,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:01:08,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:09,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:01:09,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087220551] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:09,793 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:09,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 29 [2022-03-15 19:01:09,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1333228873] [2022-03-15 19:01:09,793 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:09,795 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:09,809 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 228 transitions. [2022-03-15 19:01:09,809 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:16,441 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [432193#(and (or (<= 1 ~g2~0) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (<= 1 ~g2~0) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (<= (div ~g2~0 256) 0) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (<= (div ~g2~0 256) 0) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 432195#(and (or (= ~g2~0 0) (<= 2 ~pos~0) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= ~pos~0 2) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)))), 432196#(and (= ~g2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)) (= ~g3~0 1)), 432194#(and (or (<= ~pos~0 2) (= (mod ~g2~0 256) 0) (not (= (mod ~d2~0 256) 0))) (or (<= 2 ~pos~0) (= (mod ~g2~0 256) 0) (not (= (mod ~d2~0 256) 0))) (or (= ~g2~0 1) (= (mod ~g2~0 256) 0))), 432192#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 19:01:16,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:01:16,441 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:16,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:01:16,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:01:16,442 INFO L87 Difference]: Start difference. First operand 2160 states and 8359 transitions. Second operand has 17 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:17,530 INFO L93 Difference]: Finished difference Result 3417 states and 12120 transitions. [2022-03-15 19:01:17,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:01:17,530 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:01:17,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:17,537 INFO L225 Difference]: With dead ends: 3417 [2022-03-15 19:01:17,537 INFO L226 Difference]: Without dead ends: 3394 [2022-03-15 19:01:17,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 55 SyntacticMatches, 52 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1800 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=696, Invalid=2496, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:01:17,538 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:17,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 0 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:01:17,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2022-03-15 19:01:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 2186. [2022-03-15 19:01:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2186 states, 2185 states have (on average 3.8640732265446225) internal successors, (8443), 2185 states have internal predecessors, (8443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 8443 transitions. [2022-03-15 19:01:17,573 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 8443 transitions. Word has length 24 [2022-03-15 19:01:17,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:17,573 INFO L470 AbstractCegarLoop]: Abstraction has 2186 states and 8443 transitions. [2022-03-15 19:01:17,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.5) internal successors, (88), 16 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:17,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 8443 transitions. [2022-03-15 19:01:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:01:17,576 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:17,577 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:17,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-03-15 19:01:17,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-03-15 19:01:17,791 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:17,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:17,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1422949447, now seen corresponding path program 77 times [2022-03-15 19:01:17,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:17,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059745545] [2022-03-15 19:01:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:17,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:18,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:18,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059745545] [2022-03-15 19:01:18,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059745545] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:18,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154546077] [2022-03-15 19:01:18,106 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:01:18,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:18,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:18,107 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:18,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-03-15 19:01:18,296 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:01:18,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:01:18,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:01:18,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:18,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:01:19,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154546077] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:19,527 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:19,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 30 [2022-03-15 19:01:19,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1880192391] [2022-03-15 19:01:19,527 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:19,529 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:19,543 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 210 transitions. [2022-03-15 19:01:19,543 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:25,393 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [440199#(and (or (<= 1 ~g2~0) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (<= 1 ~g2~0) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (<= (div ~g2~0 256) 0) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (<= (div ~g2~0 256) 0) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 440200#(and (or (= ~g2~0 0) (<= 1 ~g2~0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= ~g2~0 1)) (or (= ~g2~0 0) (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0)))), 440198#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 440201#(and (= ~d2~0 1) (= ~g2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)) (= ~g3~0 1))] [2022-03-15 19:01:25,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:01:25,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:25,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:01:25,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=963, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:01:25,394 INFO L87 Difference]: Start difference. First operand 2186 states and 8443 transitions. Second operand has 17 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:26,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:26,477 INFO L93 Difference]: Finished difference Result 3111 states and 11451 transitions. [2022-03-15 19:01:26,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:01:26,477 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:01:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:26,483 INFO L225 Difference]: With dead ends: 3111 [2022-03-15 19:01:26,483 INFO L226 Difference]: Without dead ends: 3098 [2022-03-15 19:01:26,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 50 SyntacticMatches, 52 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=599, Invalid=2053, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:01:26,484 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 152 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:26,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 0 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:01:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2022-03-15 19:01:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 2206. [2022-03-15 19:01:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2206 states, 2205 states have (on average 3.8648526077097505) internal successors, (8522), 2205 states have internal predecessors, (8522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 8522 transitions. [2022-03-15 19:01:26,517 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 8522 transitions. Word has length 24 [2022-03-15 19:01:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:26,517 INFO L470 AbstractCegarLoop]: Abstraction has 2206 states and 8522 transitions. [2022-03-15 19:01:26,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:26,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 8522 transitions. [2022-03-15 19:01:26,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:01:26,521 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:26,521 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:26,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-03-15 19:01:26,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:26,728 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:26,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:26,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1026613497, now seen corresponding path program 78 times [2022-03-15 19:01:26,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:26,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762392962] [2022-03-15 19:01:26,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:26,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:26,978 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:26,978 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762392962] [2022-03-15 19:01:26,978 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762392962] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:26,978 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526310558] [2022-03-15 19:01:26,979 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:01:26,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:26,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:26,990 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:27,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-03-15 19:01:27,154 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:01:27,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:01:27,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:01:27,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:27,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:28,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526310558] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:28,379 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:28,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2022-03-15 19:01:28,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1631625220] [2022-03-15 19:01:28,379 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:28,380 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:28,395 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 216 transitions. [2022-03-15 19:01:28,395 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:33,490 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [447927#(and (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1))), 447926#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 447925#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 19:01:33,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:01:33,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:33,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:01:33,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:01:33,492 INFO L87 Difference]: Start difference. First operand 2206 states and 8522 transitions. Second operand has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:36,773 INFO L93 Difference]: Finished difference Result 4129 states and 14569 transitions. [2022-03-15 19:01:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 19:01:36,773 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:01:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:36,782 INFO L225 Difference]: With dead ends: 4129 [2022-03-15 19:01:36,783 INFO L226 Difference]: Without dead ends: 4088 [2022-03-15 19:01:36,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 48 SyntacticMatches, 60 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3427 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1256, Invalid=5064, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 19:01:36,784 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 146 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:36,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 0 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:01:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2022-03-15 19:01:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 2232. [2022-03-15 19:01:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 2231 states have (on average 3.87315105333931) internal successors, (8641), 2231 states have internal predecessors, (8641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 8641 transitions. [2022-03-15 19:01:36,835 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 8641 transitions. Word has length 24 [2022-03-15 19:01:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:36,835 INFO L470 AbstractCegarLoop]: Abstraction has 2232 states and 8641 transitions. [2022-03-15 19:01:36,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 8641 transitions. [2022-03-15 19:01:36,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:01:36,839 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:36,839 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:36,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-03-15 19:01:37,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:37,053 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:37,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:37,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1089808855, now seen corresponding path program 79 times [2022-03-15 19:01:37,054 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:37,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370510614] [2022-03-15 19:01:37,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:37,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:37,318 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:37,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370510614] [2022-03-15 19:01:37,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370510614] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:37,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973154651] [2022-03-15 19:01:37,319 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:01:37,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:37,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:37,320 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:37,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-03-15 19:01:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:37,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:01:37,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:37,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:38,598 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:01:38,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973154651] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:38,599 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:38,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2022-03-15 19:01:38,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [98391791] [2022-03-15 19:01:38,599 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:38,605 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:38,617 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 144 transitions. [2022-03-15 19:01:38,617 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:41,518 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [456785#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0)))), 456792#(and (= ~d2~0 1) (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= ~pos~0 1) (<= 1 ~pos~0) (= ~d3~0 1) (= ~g3~0 1)), 456788#(and (or (<= (div ~d1~0 256) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 1 ~d1~0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g3~0 256) 0)))), 456786#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 3 ~pos~0)) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 3) (not (= (mod ~g3~0 256) 0)))), 456794#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 456793#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0))), 456783#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 456784#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 456790#(and (or (= 0 (mod ~d3~0 256)) (<= (div ~d1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 1 ~d1~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0))), 456791#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0))), 456787#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (<= (div ~d1~0 256) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 1 ~d1~0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0)))), 456789#(and (or (not (= 0 (mod ~d3~0 256))) (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= (div ~d1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 1 ~d1~0) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:01:41,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:01:41,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:41,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:01:41,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1380, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:01:41,519 INFO L87 Difference]: Start difference. First operand 2232 states and 8641 transitions. Second operand has 25 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 24 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:43,954 INFO L93 Difference]: Finished difference Result 3764 states and 13743 transitions. [2022-03-15 19:01:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 19:01:43,955 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 24 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:01:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:43,962 INFO L225 Difference]: With dead ends: 3764 [2022-03-15 19:01:43,962 INFO L226 Difference]: Without dead ends: 3750 [2022-03-15 19:01:43,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 59 SyntacticMatches, 9 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1045, Invalid=4807, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 19:01:43,963 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 469 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:43,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 0 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:01:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3750 states. [2022-03-15 19:01:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3750 to 2242. [2022-03-15 19:01:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2241 states have (on average 3.8750557786702364) internal successors, (8684), 2241 states have internal predecessors, (8684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 8684 transitions. [2022-03-15 19:01:44,009 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 8684 transitions. Word has length 24 [2022-03-15 19:01:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:44,010 INFO L470 AbstractCegarLoop]: Abstraction has 2242 states and 8684 transitions. [2022-03-15 19:01:44,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 24 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 8684 transitions. [2022-03-15 19:01:44,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:01:44,014 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:44,014 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:44,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-03-15 19:01:44,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2022-03-15 19:01:44,219 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:44,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash -146234231, now seen corresponding path program 80 times [2022-03-15 19:01:44,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:44,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681685985] [2022-03-15 19:01:44,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:44,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:44,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:44,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681685985] [2022-03-15 19:01:44,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681685985] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:44,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303751847] [2022-03-15 19:01:44,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:01:44,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:44,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:44,506 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:44,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-03-15 19:01:44,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:01:44,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:01:44,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:01:44,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:45,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:45,784 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303751847] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:45,785 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:45,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2022-03-15 19:01:45,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [187504016] [2022-03-15 19:01:45,785 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:45,786 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:45,796 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 134 transitions. [2022-03-15 19:01:45,796 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:48,402 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [465290#(and (or (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (<= (div ~d1~0 256) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 1 ~d1~0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0)))), 465288#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (= ~g2~0 1) (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 465295#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0))), 465285#(and (or (not (= (mod ~g2~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g2~0 256) 0)) (< 0 (+ ~pos~0 1)))), 465291#(and (or (<= (div ~d1~0 256) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 1 ~d1~0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= (+ (- 1) ~d2~0) 0) (not (= (mod ~g3~0 256) 0)))), 465297#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 465293#(and (or (= 0 (mod ~d3~0 256)) (<= (div ~d1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 1 ~d1~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0))), 465282#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 465283#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 465289#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 3 ~pos~0)) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 3) (not (= (mod ~g3~0 256) 0)))), 465294#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0))), 465284#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 465286#(and (or (not (= (mod ~g2~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g2~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 465292#(and (or (not (= 0 (mod ~d3~0 256))) (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= (div ~d1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 1 ~d1~0) (= (mod ~g3~0 256) 0))), 465287#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 465296#(and (= ~d2~0 1) (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= ~pos~0 1) (<= 1 ~pos~0) (= ~d3~0 1) (= ~g3~0 1))] [2022-03-15 19:01:48,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:01:48,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:48,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:01:48,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=1733, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:01:48,403 INFO L87 Difference]: Start difference. First operand 2242 states and 8684 transitions. Second operand has 29 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:53,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:53,790 INFO L93 Difference]: Finished difference Result 4052 states and 14737 transitions. [2022-03-15 19:01:53,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 19:01:53,790 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:01:53,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:53,799 INFO L225 Difference]: With dead ends: 4052 [2022-03-15 19:01:53,799 INFO L226 Difference]: Without dead ends: 4016 [2022-03-15 19:01:53,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4117 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2206, Invalid=11600, Unknown=0, NotChecked=0, Total=13806 [2022-03-15 19:01:53,800 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 987 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:53,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [987 Valid, 0 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:01:53,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2022-03-15 19:01:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 2256. [2022-03-15 19:01:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 3.88159645232816) internal successors, (8753), 2255 states have internal predecessors, (8753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 8753 transitions. [2022-03-15 19:01:53,845 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 8753 transitions. Word has length 24 [2022-03-15 19:01:53,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:53,845 INFO L470 AbstractCegarLoop]: Abstraction has 2256 states and 8753 transitions. [2022-03-15 19:01:53,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 8753 transitions. [2022-03-15 19:01:53,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:01:53,849 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:53,849 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:53,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-03-15 19:01:54,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:54,071 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:54,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:54,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1960549889, now seen corresponding path program 81 times [2022-03-15 19:01:54,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:54,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65943458] [2022-03-15 19:01:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:54,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:01:54,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:54,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65943458] [2022-03-15 19:01:54,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65943458] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:54,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195252153] [2022-03-15 19:01:54,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:01:54,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:54,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:54,315 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:54,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-03-15 19:01:54,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:01:54,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:01:54,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:01:54,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:54,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:01:55,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195252153] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:55,591 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:55,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 29 [2022-03-15 19:01:55,591 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1240876348] [2022-03-15 19:01:55,591 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:55,593 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:55,603 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 146 transitions. [2022-03-15 19:01:55,603 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:57,907 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [474173#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 474183#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0))), 474184#(and (= ~d2~0 1) (= ~g2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)) (= ~g3~0 1)), 474181#(and (or (not (= 0 (mod ~d3~0 256))) (<= 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0))), 474178#(and (or (= ~g2~0 1) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (= ~g2~0 1) (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0)) (<= 1 ~d1~0)) (or (= ~g2~0 1) (<= 0 (+ ~pos~0 1)) (not (= (mod ~g3~0 256) 0))) (or (<= (div ~d1~0 256) 0) (= ~g2~0 1) (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 474175#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 474176#(and (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 474174#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 474180#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~d2~0 1) (not (= (mod ~g3~0 256) 0)))), 474116#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 474182#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0))), 474177#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0))), 474179#(and (or (= ~g2~0 1) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))))] [2022-03-15 19:01:57,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:01:57,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:57,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:01:57,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1441, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:01:57,908 INFO L87 Difference]: Start difference. First operand 2256 states and 8753 transitions. Second operand has 25 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:00,873 INFO L93 Difference]: Finished difference Result 3580 states and 13184 transitions. [2022-03-15 19:02:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 19:02:00,873 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:02:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:00,880 INFO L225 Difference]: With dead ends: 3580 [2022-03-15 19:02:00,880 INFO L226 Difference]: Without dead ends: 3552 [2022-03-15 19:02:00,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 55 SyntacticMatches, 12 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2603 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1429, Invalid=6581, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 19:02:00,882 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 526 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:00,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [526 Valid, 0 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:02:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2022-03-15 19:02:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 2260. [2022-03-15 19:02:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 2259 states have (on average 3.887560867640549) internal successors, (8782), 2259 states have internal predecessors, (8782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 8782 transitions. [2022-03-15 19:02:00,921 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 8782 transitions. Word has length 24 [2022-03-15 19:02:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:00,921 INFO L470 AbstractCegarLoop]: Abstraction has 2260 states and 8782 transitions. [2022-03-15 19:02:00,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 8782 transitions. [2022-03-15 19:02:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:02:00,924 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:00,924 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:00,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-03-15 19:02:01,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:01,136 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:01,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:01,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1383729123, now seen corresponding path program 82 times [2022-03-15 19:02:01,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:01,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978274678] [2022-03-15 19:02:01,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:01,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:01,605 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:01,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:01,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978274678] [2022-03-15 19:02:01,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978274678] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:01,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116922061] [2022-03-15 19:02:01,606 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:02:01,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:01,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:01,607 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:01,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-03-15 19:02:01,772 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:02:01,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:01,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:02:01,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:02,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:02,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116922061] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:02,868 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:02,868 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2022-03-15 19:02:02,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1330110867] [2022-03-15 19:02:02,868 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:02,869 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:02,879 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 134 transitions. [2022-03-15 19:02:02,880 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:05,962 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [482549#(and (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= (mod ~d1~0 256) 0) (<= 2 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 2) (= (mod ~g1~0 256) 0))), 482553#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0))), 482551#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 482548#(and (or (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0))) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 3) (= (mod ~g1~0 256) 0) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (<= 3 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g1~0 256) 0) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (= ~g1~0 1)) (or (<= 1 ~pos~0) (= (mod ~g1~0 256) 0) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (= ~g1~0 1))), 482555#(and (or (= (mod ~d1~0 256) 0) (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1))), 482554#(and (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1))), 482550#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 482552#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)))] [2022-03-15 19:02:05,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:02:05,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:05,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:02:05,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1282, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:02:05,962 INFO L87 Difference]: Start difference. First operand 2260 states and 8782 transitions. Second operand has 21 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:12,830 INFO L93 Difference]: Finished difference Result 4972 states and 17199 transitions. [2022-03-15 19:02:12,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 19:02:12,830 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:02:12,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:12,840 INFO L225 Difference]: With dead ends: 4972 [2022-03-15 19:02:12,840 INFO L226 Difference]: Without dead ends: 4958 [2022-03-15 19:02:12,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 48 SyntacticMatches, 19 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4329 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2221, Invalid=12059, Unknown=0, NotChecked=0, Total=14280 [2022-03-15 19:02:12,841 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 671 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:12,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [671 Valid, 0 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:02:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2022-03-15 19:02:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 2260. [2022-03-15 19:02:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 2259 states have (on average 3.8791500664010625) internal successors, (8763), 2259 states have internal predecessors, (8763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 8763 transitions. [2022-03-15 19:02:12,888 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 8763 transitions. Word has length 24 [2022-03-15 19:02:12,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:12,888 INFO L470 AbstractCegarLoop]: Abstraction has 2260 states and 8763 transitions. [2022-03-15 19:02:12,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.3) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 8763 transitions. [2022-03-15 19:02:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:02:12,891 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:12,891 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:12,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2022-03-15 19:02:13,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable84 [2022-03-15 19:02:13,093 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:13,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:13,093 INFO L85 PathProgramCache]: Analyzing trace with hash 409835135, now seen corresponding path program 83 times [2022-03-15 19:02:13,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:13,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216839129] [2022-03-15 19:02:13,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:13,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:13,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:13,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216839129] [2022-03-15 19:02:13,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216839129] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:13,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177222118] [2022-03-15 19:02:13,446 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:02:13,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:13,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:13,448 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:13,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-03-15 19:02:13,577 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:02:13,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:13,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:02:13,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:13,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:14,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177222118] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:14,722 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:14,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2022-03-15 19:02:14,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [235181958] [2022-03-15 19:02:14,722 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:14,723 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:14,733 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 124 transitions. [2022-03-15 19:02:14,733 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:17,214 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [492379#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 492381#(and (or (= (mod ~d1~0 256) 0) (= (+ (- 1) ~d2~0) 0) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= (mod ~d1~0 256) 0) (<= 2 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 2) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (= (mod ~g1~0 256) 0))), 492383#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0))), 492385#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~d2~0 1) (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (= (mod ~g1~0 256) 0))), 492322#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 492382#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~d2~0 1) (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (= (mod ~g1~0 256) 0))), 492384#(and (or (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0))), 492380#(and (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (= (mod ~g1~0 256) 0)))] [2022-03-15 19:02:17,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:02:17,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:17,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:02:17,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1167, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:02:17,215 INFO L87 Difference]: Start difference. First operand 2260 states and 8763 transitions. Second operand has 21 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:19,321 INFO L93 Difference]: Finished difference Result 3139 states and 11899 transitions. [2022-03-15 19:02:19,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:02:19,321 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:02:19,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:19,327 INFO L225 Difference]: With dead ends: 3139 [2022-03-15 19:02:19,327 INFO L226 Difference]: Without dead ends: 3120 [2022-03-15 19:02:19,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 19 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=901, Invalid=4355, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 19:02:19,328 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 391 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:19,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 0 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:02:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2022-03-15 19:02:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2338. [2022-03-15 19:02:19,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2338 states, 2337 states have (on average 3.887890457851947) internal successors, (9086), 2337 states have internal predecessors, (9086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 9086 transitions. [2022-03-15 19:02:19,363 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 9086 transitions. Word has length 24 [2022-03-15 19:02:19,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:19,363 INFO L470 AbstractCegarLoop]: Abstraction has 2338 states and 9086 transitions. [2022-03-15 19:02:19,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 9086 transitions. [2022-03-15 19:02:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:02:19,367 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:19,367 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:19,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-03-15 19:02:19,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:19,583 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:19,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:19,584 INFO L85 PathProgramCache]: Analyzing trace with hash 940829983, now seen corresponding path program 84 times [2022-03-15 19:02:19,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:19,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861209323] [2022-03-15 19:02:19,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:19,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:19,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:19,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861209323] [2022-03-15 19:02:19,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861209323] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:19,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386549334] [2022-03-15 19:02:19,822 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:02:19,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:19,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:19,823 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:19,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-03-15 19:02:19,968 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:02:19,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:19,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:02:19,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:20,230 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:20,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:20,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386549334] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:20,957 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:20,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2022-03-15 19:02:20,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1108048351] [2022-03-15 19:02:20,957 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:20,958 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:20,969 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 138 transitions. [2022-03-15 19:02:20,969 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:24,476 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [500442#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 500444#(and (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= ~pos~0 1) (<= 1 ~pos~0) (= ~d3~0 1)), 500443#(and (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= ~pos~0 1) (<= 1 ~pos~0)), 500446#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (<= ~pos~0 0)) (or (<= ~pos~0 4) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (<= (div ~d2~0 256) 0) (<= 4 ~pos~0)) (or (= ~g2~0 0) (<= (div ~d2~0 256) 0) (<= ~pos~0 4)) (or (= ~g2~0 0) (<= (div ~d2~0 256) 0) (<= 0 ~pos~0)) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0))) (or (= ~g2~0 1) (= ~g2~0 0)) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (<= 0 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 0) (<= (div ~d2~0 256) 0) (<= ~pos~0 0))), 500445#(and (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 500441#(and (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= 2 ~pos~0) (<= ~pos~0 2) (= (* (div ~d3~0 256) 256) ~d3~0))] [2022-03-15 19:02:24,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:02:24,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:24,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:02:24,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1089, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:02:24,494 INFO L87 Difference]: Start difference. First operand 2338 states and 9086 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:25,059 INFO L93 Difference]: Finished difference Result 2575 states and 9867 transitions. [2022-03-15 19:02:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:02:25,059 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:02:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:25,064 INFO L225 Difference]: With dead ends: 2575 [2022-03-15 19:02:25,064 INFO L226 Difference]: Without dead ends: 2568 [2022-03-15 19:02:25,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 46 SyntacticMatches, 23 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=468, Invalid=1602, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:02:25,065 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:25,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:02:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-03-15 19:02:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2352. [2022-03-15 19:02:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2351 states have (on average 3.883453849425776) internal successors, (9130), 2351 states have internal predecessors, (9130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 9130 transitions. [2022-03-15 19:02:25,098 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 9130 transitions. Word has length 24 [2022-03-15 19:02:25,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:25,098 INFO L470 AbstractCegarLoop]: Abstraction has 2352 states and 9130 transitions. [2022-03-15 19:02:25,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:25,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 9130 transitions. [2022-03-15 19:02:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:02:25,102 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:25,102 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:25,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-03-15 19:02:25,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:25,315 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:25,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:25,316 INFO L85 PathProgramCache]: Analyzing trace with hash -417588513, now seen corresponding path program 85 times [2022-03-15 19:02:25,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:25,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563948369] [2022-03-15 19:02:25,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:25,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:25,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:25,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563948369] [2022-03-15 19:02:25,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563948369] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:25,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511914300] [2022-03-15 19:02:25,609 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:02:25,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:25,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:25,610 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:25,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-03-15 19:02:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:25,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:02:25,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:26,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:27,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511914300] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:27,272 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:27,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 19:02:27,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1855745512] [2022-03-15 19:02:27,273 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:27,274 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:27,284 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 142 transitions. [2022-03-15 19:02:27,285 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:30,289 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [507910#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 507913#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 507912#(and (= ~d2~0 1) (or (<= ~pos~0 2) (= ~g3~0 0)) (or (not (= (* (div ~d3~0 256) 256) ~d3~0)) (not (= ~g3~0 0))) (or (not (= (mod ~d1~0 256) 0)) (= ~g3~0 0)) (or (<= 2 ~pos~0) (= ~g3~0 0)) (or (= ~g3~0 1) (= ~g3~0 0))), 507915#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 507914#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 5 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 5) (= (mod ~g3~0 256) 0))), 507911#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:02:30,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:02:30,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:30,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:02:30,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1020, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:02:30,290 INFO L87 Difference]: Start difference. First operand 2352 states and 9130 transitions. Second operand has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:30,852 INFO L93 Difference]: Finished difference Result 2645 states and 10174 transitions. [2022-03-15 19:02:30,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:02:30,853 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:02:30,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:30,858 INFO L225 Difference]: With dead ends: 2645 [2022-03-15 19:02:30,858 INFO L226 Difference]: Without dead ends: 2620 [2022-03-15 19:02:30,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 56 SyntacticMatches, 17 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=319, Invalid=1403, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:02:30,858 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:30,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:02:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2022-03-15 19:02:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 2434. [2022-03-15 19:02:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 3.8919030004110153) internal successors, (9469), 2433 states have internal predecessors, (9469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 9469 transitions. [2022-03-15 19:02:30,890 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 9469 transitions. Word has length 24 [2022-03-15 19:02:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:30,890 INFO L470 AbstractCegarLoop]: Abstraction has 2434 states and 9469 transitions. [2022-03-15 19:02:30,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 9469 transitions. [2022-03-15 19:02:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:02:30,894 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:30,894 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:30,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2022-03-15 19:02:31,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2022-03-15 19:02:31,111 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:31,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:31,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1051865093, now seen corresponding path program 86 times [2022-03-15 19:02:31,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:31,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812161377] [2022-03-15 19:02:31,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:31,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:31,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:31,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812161377] [2022-03-15 19:02:31,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812161377] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:31,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505217562] [2022-03-15 19:02:31,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:02:31,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:31,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:31,451 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:31,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-03-15 19:02:31,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:02:31,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:31,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:02:31,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:32,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:32,831 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:32,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505217562] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:32,831 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:32,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2022-03-15 19:02:32,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [97454515] [2022-03-15 19:02:32,831 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:32,844 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:32,854 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 124 transitions. [2022-03-15 19:02:32,854 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:35,637 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [515615#(and (or (= ~g2~0 1) (< 0 (+ ~pos~0 2))) (or (= ~g2~0 1) (<= ~pos~0 1)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (< 0 ~pos~0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= (+ ~pos~0 1) 0))), 515612#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 515618#(and (= ~g2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)) (= ~g3~0 1)), 515610#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 515614#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 515616#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g3~0 256) 0))), 515613#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 515553#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 515560#(or (not (<= (mod ~g2~0 256) 0)) (not (<= (mod ~g3~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 515611#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 515617#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:02:35,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:02:35,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:35,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:02:35,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1233, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:02:35,637 INFO L87 Difference]: Start difference. First operand 2434 states and 9469 transitions. Second operand has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:37,452 INFO L93 Difference]: Finished difference Result 3401 states and 12652 transitions. [2022-03-15 19:02:37,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 19:02:37,453 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:02:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:37,459 INFO L225 Difference]: With dead ends: 3401 [2022-03-15 19:02:37,459 INFO L226 Difference]: Without dead ends: 3384 [2022-03-15 19:02:37,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 45 SyntacticMatches, 17 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1851 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1189, Invalid=4511, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 19:02:37,460 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 438 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:37,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 0 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:02:37,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2022-03-15 19:02:37,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 2442. [2022-03-15 19:02:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2441 states have (on average 3.890618598934863) internal successors, (9497), 2441 states have internal predecessors, (9497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9497 transitions. [2022-03-15 19:02:37,495 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9497 transitions. Word has length 24 [2022-03-15 19:02:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:37,495 INFO L470 AbstractCegarLoop]: Abstraction has 2442 states and 9497 transitions. [2022-03-15 19:02:37,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9497 transitions. [2022-03-15 19:02:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:02:37,499 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:37,499 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:37,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2022-03-15 19:02:37,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:37,715 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:37,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash -137682985, now seen corresponding path program 87 times [2022-03-15 19:02:37,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:37,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555709334] [2022-03-15 19:02:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:37,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:38,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:38,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555709334] [2022-03-15 19:02:38,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555709334] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:38,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56639209] [2022-03-15 19:02:38,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:02:38,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:38,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:38,090 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:38,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-03-15 19:02:38,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:02:38,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:38,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:02:38,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:38,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:39,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56639209] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:39,203 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:39,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2022-03-15 19:02:39,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1363965971] [2022-03-15 19:02:39,203 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:39,205 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:39,215 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 139 transitions. [2022-03-15 19:02:39,215 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:42,107 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [524151#(and (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0))), 524147#(and (or (= ~g2~0 0) (<= (div ~d2~0 256) 0) (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= (div ~d2~0 256) 0) (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (<= 2 ~pos~0) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 2) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0))) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0)) (not (= ~g2~0 0)))), 524145#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 524146#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 524150#(and (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= ~pos~0 1) (<= 1 ~pos~0) (= ~g3~0 1)), 524144#(and (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= ~g2~0 0) (<= (div ~d2~0 256) 0)) (or (<= 1 ~pos~0) (= ~g2~0 0) (<= (div ~d2~0 256) 0)) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0))) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (not (= (mod ~d1~0 256) 0)) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (<= 3 ~pos~0)) (or (<= ~pos~0 3) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 0) (<= (div ~d2~0 256) 0) (<= 3 ~pos~0)) (or (= ~g2~0 1) (= ~g2~0 0)) (or (<= 1 ~pos~0) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (= ~g2~0 0) (<= (div ~d2~0 256) 0) (<= ~pos~0 3))), 524152#(and (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 524148#(and (or (<= 1 ~d1~0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (<= (div ~d1~0 256) 0) (= (mod ~g3~0 256) 0))), 524149#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:02:42,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:02:42,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:42,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:02:42,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1239, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:02:42,108 INFO L87 Difference]: Start difference. First operand 2442 states and 9497 transitions. Second operand has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:47,725 INFO L93 Difference]: Finished difference Result 3259 states and 12056 transitions. [2022-03-15 19:02:47,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 19:02:47,725 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:02:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:47,732 INFO L225 Difference]: With dead ends: 3259 [2022-03-15 19:02:47,732 INFO L226 Difference]: Without dead ends: 3252 [2022-03-15 19:02:47,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 52 SyntacticMatches, 17 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2360 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1530, Invalid=7026, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 19:02:47,732 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 442 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:47,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [442 Valid, 0 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:02:47,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2022-03-15 19:02:47,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 2442. [2022-03-15 19:02:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2441 states have (on average 3.890618598934863) internal successors, (9497), 2441 states have internal predecessors, (9497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9497 transitions. [2022-03-15 19:02:47,770 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9497 transitions. Word has length 24 [2022-03-15 19:02:47,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:47,770 INFO L470 AbstractCegarLoop]: Abstraction has 2442 states and 9497 transitions. [2022-03-15 19:02:47,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9497 transitions. [2022-03-15 19:02:47,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:02:47,773 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:47,773 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:47,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-03-15 19:02:47,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:47,991 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:47,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:47,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1111576973, now seen corresponding path program 88 times [2022-03-15 19:02:47,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:47,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144032901] [2022-03-15 19:02:47,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:48,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:48,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144032901] [2022-03-15 19:02:48,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144032901] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:48,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858489716] [2022-03-15 19:02:48,269 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:02:48,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:48,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:48,270 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:48,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-03-15 19:02:48,418 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:02:48,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:48,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:02:48,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:48,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:49,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858489716] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:49,589 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:49,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 19:02:49,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [633130719] [2022-03-15 19:02:49,589 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:49,590 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:49,607 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 129 transitions. [2022-03-15 19:02:49,607 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:51,919 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [532580#(and (or (= ~g2~0 1) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (= ~g2~0 1) (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0)) (<= 1 ~d1~0)) (or (= ~g2~0 1) (<= 0 (+ ~pos~0 1)) (not (= (mod ~g3~0 256) 0))) (or (<= (div ~d1~0 256) 0) (= ~g2~0 1) (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 532582#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0))), 532575#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 532579#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 532578#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 532584#(and (= ~g2~0 1) (<= 2 ~pos~0) (<= ~pos~0 2)), 532577#(and (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 532517#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 532583#(and (= ~d2~0 1) (= ~g2~0 1) (<= ~pos~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1)) (= ~g3~0 1)), 532576#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 532581#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:02:51,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:02:51,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:51,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:02:51,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1444, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:02:51,920 INFO L87 Difference]: Start difference. First operand 2442 states and 9497 transitions. Second operand has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:54,844 INFO L93 Difference]: Finished difference Result 3817 states and 14087 transitions. [2022-03-15 19:02:54,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 19:02:54,845 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:02:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:54,852 INFO L225 Difference]: With dead ends: 3817 [2022-03-15 19:02:54,852 INFO L226 Difference]: Without dead ends: 3768 [2022-03-15 19:02:54,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 46 SyntacticMatches, 15 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2817 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1575, Invalid=7167, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 19:02:54,853 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 643 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:54,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 0 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:02:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2022-03-15 19:02:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 2514. [2022-03-15 19:02:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2514 states, 2513 states have (on average 3.9060883406287306) internal successors, (9816), 2513 states have internal predecessors, (9816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 9816 transitions. [2022-03-15 19:02:54,891 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 9816 transitions. Word has length 24 [2022-03-15 19:02:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:54,891 INFO L470 AbstractCegarLoop]: Abstraction has 2514 states and 9816 transitions. [2022-03-15 19:02:54,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 9816 transitions. [2022-03-15 19:02:54,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:02:54,895 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:54,895 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:54,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2022-03-15 19:02:55,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:55,124 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:55,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:55,124 INFO L85 PathProgramCache]: Analyzing trace with hash -982654437, now seen corresponding path program 89 times [2022-03-15 19:02:55,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:55,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787858071] [2022-03-15 19:02:55,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:55,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:55,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:55,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787858071] [2022-03-15 19:02:55,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787858071] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:55,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721545593] [2022-03-15 19:02:55,528 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:02:55,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:55,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:55,530 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:55,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-03-15 19:02:55,712 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:02:55,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:55,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:02:55,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:56,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:57,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721545593] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:57,102 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:57,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2022-03-15 19:02:57,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1741822836] [2022-03-15 19:02:57,103 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:57,104 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:57,114 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 134 transitions. [2022-03-15 19:02:57,114 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:00,119 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [541708#(and (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= ~pos~0 1) (<= 1 ~pos~0) (= ~g3~0 1)), 541705#(and (or (<= 1 ~d1~0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (<= (div ~d1~0 256) 0) (= (mod ~g3~0 256) 0))), 541703#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 541701#(and (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= ~g2~0 0) (<= (div ~d2~0 256) 0)) (or (<= 1 ~pos~0) (= ~g2~0 0) (<= (div ~d2~0 256) 0)) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0))) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (not (= (mod ~d1~0 256) 0)) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (<= 3 ~pos~0)) (or (<= ~pos~0 3) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 0) (<= (div ~d2~0 256) 0) (<= 3 ~pos~0)) (or (= ~g2~0 1) (= ~g2~0 0)) (or (<= 1 ~pos~0) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (= ~g2~0 0) (<= (div ~d2~0 256) 0) (<= ~pos~0 3))), 541707#(and (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0))), 541709#(and (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 541704#(and (or (= ~g2~0 0) (<= (div ~d2~0 256) 0) (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= (div ~d2~0 256) 0) (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (<= 2 ~pos~0) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 2) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0))) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0)) (not (= ~g2~0 0)))), 541706#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 541702#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 19:03:00,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:03:00,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:00,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:03:00,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:03:00,120 INFO L87 Difference]: Start difference. First operand 2514 states and 9816 transitions. Second operand has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:06,396 INFO L93 Difference]: Finished difference Result 3675 states and 13398 transitions. [2022-03-15 19:03:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-15 19:03:06,396 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:03:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:06,404 INFO L225 Difference]: With dead ends: 3675 [2022-03-15 19:03:06,404 INFO L226 Difference]: Without dead ends: 3668 [2022-03-15 19:03:06,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 52 SyntacticMatches, 14 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3149 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1970, Invalid=9586, Unknown=0, NotChecked=0, Total=11556 [2022-03-15 19:03:06,405 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 477 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:06,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 0 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:03:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3668 states. [2022-03-15 19:03:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 2518. [2022-03-15 19:03:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2517 states have (on average 3.9054429876837506) internal successors, (9830), 2517 states have internal predecessors, (9830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 9830 transitions. [2022-03-15 19:03:06,447 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 9830 transitions. Word has length 24 [2022-03-15 19:03:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:06,447 INFO L470 AbstractCegarLoop]: Abstraction has 2518 states and 9830 transitions. [2022-03-15 19:03:06,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 21 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 9830 transitions. [2022-03-15 19:03:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:03:06,451 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:06,451 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:06,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-03-15 19:03:06,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable91 [2022-03-15 19:03:06,665 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:06,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:06,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1956548425, now seen corresponding path program 90 times [2022-03-15 19:03:06,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:06,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210090950] [2022-03-15 19:03:06,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:06,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:06,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:06,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210090950] [2022-03-15 19:03:06,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210090950] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:06,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331532061] [2022-03-15 19:03:06,917 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:03:06,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:06,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:06,918 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:06,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-03-15 19:03:07,091 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:03:07,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:07,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:03:07,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:07,436 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:07,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:08,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331532061] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:08,580 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:08,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2022-03-15 19:03:08,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1353392309] [2022-03-15 19:03:08,580 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:08,581 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:08,591 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 124 transitions. [2022-03-15 19:03:08,591 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:10,193 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [550722#(and (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= ~pos~0 1) (<= 1 ~pos~0)), 550725#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 550720#(and (or (not (= (mod ~g2~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g2~0 256) 0)) (< 0 (+ ~pos~0 1)))), 550724#(and (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 550671#(and (or (not (= (mod ~d1~0 256) 0)) (and (<= ~pos~0 1) (< 0 ~pos~0))) (or (= (mod ~d1~0 256) 0) (and (<= (+ ~pos~0 1) 0) (< 0 (+ ~pos~0 2))))), 550721#(and (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (<= (div ~d1~0 256) 0) (= ~g2~0 1) (<= ~pos~0 0) (<= 1 ~d1~0) (<= 0 ~pos~0)), 550723#(and (= ~d2~0 1) (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= ~pos~0 1) (<= 1 ~pos~0) (= ~d3~0 1))] [2022-03-15 19:03:10,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:03:10,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:10,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:03:10,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:03:10,194 INFO L87 Difference]: Start difference. First operand 2518 states and 9830 transitions. Second operand has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:10,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:10,653 INFO L93 Difference]: Finished difference Result 2871 states and 11039 transitions. [2022-03-15 19:03:10,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:03:10,653 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:03:10,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:10,659 INFO L225 Difference]: With dead ends: 2871 [2022-03-15 19:03:10,659 INFO L226 Difference]: Without dead ends: 2858 [2022-03-15 19:03:10,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 48 SyntacticMatches, 22 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=1055, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:03:10,659 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:10,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:03:10,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2022-03-15 19:03:10,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2538. [2022-03-15 19:03:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2537 states have (on average 3.9061884115096572) internal successors, (9910), 2537 states have internal predecessors, (9910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 9910 transitions. [2022-03-15 19:03:10,697 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 9910 transitions. Word has length 24 [2022-03-15 19:03:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:10,698 INFO L470 AbstractCegarLoop]: Abstraction has 2538 states and 9910 transitions. [2022-03-15 19:03:10,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 9910 transitions. [2022-03-15 19:03:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:03:10,701 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:10,701 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:10,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Forceful destruction successful, exit code 0 [2022-03-15 19:03:10,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:10,920 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:10,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1425553577, now seen corresponding path program 91 times [2022-03-15 19:03:10,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:10,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124008157] [2022-03-15 19:03:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:10,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:11,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:11,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124008157] [2022-03-15 19:03:11,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124008157] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:11,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022362713] [2022-03-15 19:03:11,317 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:03:11,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:11,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:11,318 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:11,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-03-15 19:03:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:11,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:03:11,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:11,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:12,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022362713] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:12,746 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:12,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2022-03-15 19:03:12,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [819637233] [2022-03-15 19:03:12,747 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:12,748 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:12,758 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 138 transitions. [2022-03-15 19:03:12,759 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:15,770 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [558853#(and (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (<= 4 ~pos~0)) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0))) (or (= ~g2~0 1) (= ~g2~0 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 0) (<= ~pos~0 0)) (or (= ~g2~0 0) (<= 0 ~pos~0)) (or (= ~g2~0 0) (<= ~pos~0 4))), 558851#(and (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (or (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))) (or (= (* 256 (div ~d1~0 256)) ~d1~0) (<= ~pos~0 0)) (or (= (* 256 (div ~d1~0 256)) ~d1~0) (<= 0 ~pos~0))), 558857#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0))), 558852#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 558854#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0))), 558858#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 558855#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0))), 558856#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0)))] [2022-03-15 19:03:15,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:03:15,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:15,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:03:15,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1179, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:03:15,771 INFO L87 Difference]: Start difference. First operand 2538 states and 9910 transitions. Second operand has 21 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:18,457 INFO L93 Difference]: Finished difference Result 3952 states and 14384 transitions. [2022-03-15 19:03:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 19:03:18,457 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:03:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:18,466 INFO L225 Difference]: With dead ends: 3952 [2022-03-15 19:03:18,466 INFO L226 Difference]: Without dead ends: 3938 [2022-03-15 19:03:18,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 48 SyntacticMatches, 22 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1651 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=869, Invalid=5137, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 19:03:18,467 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 302 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:18,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 0 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:03:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2022-03-15 19:03:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 2546. [2022-03-15 19:03:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2545 states have (on average 3.9033398821218075) internal successors, (9934), 2545 states have internal predecessors, (9934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 9934 transitions. [2022-03-15 19:03:18,513 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 9934 transitions. Word has length 24 [2022-03-15 19:03:18,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:18,513 INFO L470 AbstractCegarLoop]: Abstraction has 2546 states and 9934 transitions. [2022-03-15 19:03:18,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 9934 transitions. [2022-03-15 19:03:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:03:18,517 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:18,517 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:18,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Forceful destruction successful, exit code 0 [2022-03-15 19:03:18,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:18,731 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:18,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:18,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1510995223, now seen corresponding path program 92 times [2022-03-15 19:03:18,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:18,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118783839] [2022-03-15 19:03:18,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:18,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:19,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:19,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118783839] [2022-03-15 19:03:19,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118783839] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:19,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822955929] [2022-03-15 19:03:19,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:03:19,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:19,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:19,021 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:19,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-03-15 19:03:19,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:03:19,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:19,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:03:19,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:19,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:03:20,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822955929] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:20,464 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:20,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2022-03-15 19:03:20,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1274210001] [2022-03-15 19:03:20,464 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:20,466 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:20,476 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 142 transitions. [2022-03-15 19:03:20,476 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:23,238 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [568155#(and (= ~d2~0 1) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (<= 1 ~pos~0) (= ~d3~0 1) (= ~g3~0 1)), 568156#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 568151#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 568154#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 568153#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 5 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 5) (= (mod ~g3~0 256) 0))), 568152#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 1 ~d1~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= (div ~d1~0 256) 0) (= (mod ~g3~0 256) 0))), 568150#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 19:03:23,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:03:23,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:23,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:03:23,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:03:23,239 INFO L87 Difference]: Start difference. First operand 2546 states and 9934 transitions. Second operand has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:23,787 INFO L93 Difference]: Finished difference Result 2687 states and 10415 transitions. [2022-03-15 19:03:23,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:03:23,787 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:03:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:23,809 INFO L225 Difference]: With dead ends: 2687 [2022-03-15 19:03:23,809 INFO L226 Difference]: Without dead ends: 2680 [2022-03-15 19:03:23,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 55 SyntacticMatches, 18 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=320, Invalid=1402, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:03:23,809 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 132 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:23,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 0 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:03:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2022-03-15 19:03:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 2546. [2022-03-15 19:03:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2545 states have (on average 3.9033398821218075) internal successors, (9934), 2545 states have internal predecessors, (9934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 9934 transitions. [2022-03-15 19:03:23,847 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 9934 transitions. Word has length 24 [2022-03-15 19:03:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:23,848 INFO L470 AbstractCegarLoop]: Abstraction has 2546 states and 9934 transitions. [2022-03-15 19:03:23,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 9934 transitions. [2022-03-15 19:03:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:03:23,851 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:23,852 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:23,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Ended with exit code 0 [2022-03-15 19:03:24,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:24,065 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:24,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash 876718643, now seen corresponding path program 93 times [2022-03-15 19:03:24,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:24,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857955070] [2022-03-15 19:03:24,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:24,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:24,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:24,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857955070] [2022-03-15 19:03:24,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857955070] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:24,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922909422] [2022-03-15 19:03:24,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:03:24,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:24,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:24,341 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:24,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-03-15 19:03:24,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:03:24,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:24,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:03:24,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:25,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:26,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922909422] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:26,031 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:26,031 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 19:03:26,031 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [320636817] [2022-03-15 19:03:26,031 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:26,032 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:26,042 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 124 transitions. [2022-03-15 19:03:26,042 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:28,283 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [576124#(and (= ~d2~0 1) (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= ~pos~0 1) (<= 1 ~pos~0) (= ~d3~0 1) (= ~g3~0 1)), 576128#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 576129#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g3~0 256) 0))), 576121#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 576127#(and (or (= ~g2~0 1) (< 0 (+ ~pos~0 2))) (or (= ~g2~0 1) (<= ~pos~0 1)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (< 0 ~pos~0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= (+ ~pos~0 1) 0))), 576120#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 576126#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 576061#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 576119#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 576125#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 576068#(or (not (<= (mod ~g2~0 256) 0)) (not (<= (mod ~g3~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 576122#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (<= 1 ~d1~0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= (div ~d1~0 256) 0) (= (mod ~g3~0 256) 0))), 576123#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:03:28,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:03:28,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:28,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:03:28,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1501, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:03:28,286 INFO L87 Difference]: Start difference. First operand 2546 states and 9934 transitions. Second operand has 26 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:29,817 INFO L93 Difference]: Finished difference Result 3191 states and 12073 transitions. [2022-03-15 19:03:29,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 19:03:29,818 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:03:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:29,825 INFO L225 Difference]: With dead ends: 3191 [2022-03-15 19:03:29,825 INFO L226 Difference]: Without dead ends: 3178 [2022-03-15 19:03:29,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 47 SyntacticMatches, 11 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1018, Invalid=4094, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:03:29,826 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 389 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:29,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 0 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:03:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2022-03-15 19:03:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 2552. [2022-03-15 19:03:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2551 states have (on average 3.903175225401803) internal successors, (9957), 2551 states have internal predecessors, (9957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:29,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 9957 transitions. [2022-03-15 19:03:29,867 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 9957 transitions. Word has length 24 [2022-03-15 19:03:29,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:29,867 INFO L470 AbstractCegarLoop]: Abstraction has 2552 states and 9957 transitions. [2022-03-15 19:03:29,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.2) internal successors, (80), 25 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:29,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 9957 transitions. [2022-03-15 19:03:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:03:29,871 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:29,871 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:29,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2022-03-15 19:03:30,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:30,073 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:30,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:30,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1970810231, now seen corresponding path program 94 times [2022-03-15 19:03:30,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:30,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128375429] [2022-03-15 19:03:30,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:30,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:30,461 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:30,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128375429] [2022-03-15 19:03:30,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128375429] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:30,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119599536] [2022-03-15 19:03:30,461 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:03:30,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:30,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:30,463 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:30,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-03-15 19:03:30,616 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:03:30,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:30,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:03:30,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:31,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:31,755 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:31,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119599536] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:31,755 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:31,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2022-03-15 19:03:31,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612243759] [2022-03-15 19:03:31,756 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:31,757 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:31,775 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 138 transitions. [2022-03-15 19:03:31,775 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:34,993 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [584655#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1))), 584654#(and (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0))), 584650#(and (or (not (= 0 (mod ~d3~0 256))) (< 1 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 2) 0)) (<= ~pos~0 2) (< 0 (+ ~pos~0 3))), 584652#(and (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (or (<= ~pos~0 0) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (<= 0 ~pos~0)) (or (= ~g1~0 1) (= ~g1~0 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (<= ~pos~0 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (<= 0 ~pos~0))), 584656#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0))), 584653#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1))), 584651#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g2~0 256) 0)) (< 1 ~pos~0)) (or (not (= (mod ~g2~0 256) 0)) (<= ~pos~0 2)) (or (not (= (mod ~g2~0 256) 0)) (< 0 (+ ~pos~0 3))) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~g2~0 256) 0)) (<= (+ ~pos~0 2) 0))), 584658#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g1~0 256) 0)) (< 1 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~g1~0 256) 0)) (<= (+ ~pos~0 2) 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 3))) (or (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)))), 584657#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 584659#(and (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (<= (+ ~pos~0 1) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (< 0 (+ ~pos~0 2))) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 3) (= (mod ~g1~0 256) 0))), 584660#(and (or (= ~g2~0 1) (<= ~pos~0 2)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (<= (+ ~pos~0 2) 0)) (or (= ~g2~0 1) (< 0 (+ ~pos~0 3))) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (< 1 ~pos~0))), 584593#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1))))] [2022-03-15 19:03:34,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:03:34,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:34,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:03:34,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1468, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:03:34,993 INFO L87 Difference]: Start difference. First operand 2552 states and 9957 transitions. Second operand has 25 states, 24 states have (on average 3.25) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:41,463 INFO L93 Difference]: Finished difference Result 5505 states and 18995 transitions. [2022-03-15 19:03:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 19:03:41,463 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.25) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:03:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:41,475 INFO L225 Difference]: With dead ends: 5505 [2022-03-15 19:03:41,475 INFO L226 Difference]: Without dead ends: 5330 [2022-03-15 19:03:41,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 50 SyntacticMatches, 16 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3793 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1798, Invalid=11084, Unknown=0, NotChecked=0, Total=12882 [2022-03-15 19:03:41,476 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 677 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:41,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [677 Valid, 0 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:03:41,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5330 states. [2022-03-15 19:03:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5330 to 2558. [2022-03-15 19:03:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2557 states have (on average 3.920610089949159) internal successors, (10025), 2557 states have internal predecessors, (10025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 10025 transitions. [2022-03-15 19:03:41,528 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 10025 transitions. Word has length 24 [2022-03-15 19:03:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:41,528 INFO L470 AbstractCegarLoop]: Abstraction has 2558 states and 10025 transitions. [2022-03-15 19:03:41,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.25) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 10025 transitions. [2022-03-15 19:03:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:03:41,532 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:41,532 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:41,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Ended with exit code 0 [2022-03-15 19:03:41,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2022-03-15 19:03:41,739 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:41,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:41,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1728305749, now seen corresponding path program 95 times [2022-03-15 19:03:41,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:41,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920166426] [2022-03-15 19:03:41,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:41,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:42,038 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:42,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920166426] [2022-03-15 19:03:42,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920166426] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:42,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052297956] [2022-03-15 19:03:42,038 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:03:42,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:42,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:42,039 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:42,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-03-15 19:03:42,207 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:03:42,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:42,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:03:42,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:42,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:43,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052297956] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:43,680 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:43,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2022-03-15 19:03:43,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [997807943] [2022-03-15 19:03:43,680 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:43,695 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:43,705 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 129 transitions. [2022-03-15 19:03:43,705 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:47,192 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [595603#(and (or (= (mod ~g1~0 256) 0) (= ~g1~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0))), 595598#(and (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 595604#(and (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0))), 595599#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 595602#(and (or (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0))), 595600#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g1~0 1) (= ~g1~0 0) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (<= 1 ~d1~0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (<= (div ~d1~0 256) 0) (= (mod ~g3~0 256) 0))), 595607#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 3) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0))), 595595#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 595608#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 2) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0) (< 1 ~pos~0))), 595596#(and (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (= (mod ~g1~0 256) 0))), 595538#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 595605#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 595597#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 595609#(and (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (= (mod ~g1~0 256) 0) (<= (+ ~pos~0 1) 0) (= ~g1~0 1)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0) (= ~g1~0 1) (< 0 (+ ~pos~0 2))) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (< 0 ~pos~0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= ~pos~0 1) (= (mod ~g1~0 256) 0))), 595606#(and (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0)))), 595601#(and (or (= (mod ~g1~0 256) 0) (= ~g1~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:03:47,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:03:47,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:47,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:03:47,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1738, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:03:47,193 INFO L87 Difference]: Start difference. First operand 2558 states and 10025 transitions. Second operand has 29 states, 28 states have (on average 3.107142857142857) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:53,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:53,711 INFO L93 Difference]: Finished difference Result 3703 states and 14167 transitions. [2022-03-15 19:03:53,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 19:03:53,711 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.107142857142857) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:03:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:53,720 INFO L225 Difference]: With dead ends: 3703 [2022-03-15 19:03:53,720 INFO L226 Difference]: Without dead ends: 3690 [2022-03-15 19:03:53,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 47 SyntacticMatches, 11 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4675 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2748, Invalid=12504, Unknown=0, NotChecked=0, Total=15252 [2022-03-15 19:03:53,721 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 623 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:53,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 0 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:03:53,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2022-03-15 19:03:53,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 2630. [2022-03-15 19:03:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2630 states, 2629 states have (on average 3.918980600988969) internal successors, (10303), 2629 states have internal predecessors, (10303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 10303 transitions. [2022-03-15 19:03:53,765 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 10303 transitions. Word has length 24 [2022-03-15 19:03:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:53,765 INFO L470 AbstractCegarLoop]: Abstraction has 2630 states and 10303 transitions. [2022-03-15 19:03:53,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.107142857142857) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:53,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 10303 transitions. [2022-03-15 19:03:53,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:03:53,770 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:53,770 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:53,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-03-15 19:03:53,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2022-03-15 19:03:53,987 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:53,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:53,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1985021439, now seen corresponding path program 96 times [2022-03-15 19:03:53,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:53,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895402464] [2022-03-15 19:03:53,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:53,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:54,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:54,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895402464] [2022-03-15 19:03:54,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895402464] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:54,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384289541] [2022-03-15 19:03:54,328 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:03:54,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:54,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:54,329 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:54,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-03-15 19:03:54,491 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:03:54,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:54,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:03:54,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:54,860 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:54,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:55,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384289541] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:55,993 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:55,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 19:03:55,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2117077392] [2022-03-15 19:03:55,993 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:55,994 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:56,004 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 128 transitions. [2022-03-15 19:03:56,004 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:57,696 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [604899#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 604900#(and (= ~d2~0 1) (= (+ (- 1) ~pos~0) 0) (= (mod ~d1~0 256) 0) (= ~g2~0 1) (= ~g3~0 1)), 604895#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 604901#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~pos~0 0) (= ~g2~0 1) (= ~g3~0 1)), 604898#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 604896#(and (or (not (= (mod ~g2~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g2~0 256) 0)) (< 0 (+ ~pos~0 1)))), 604894#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 604897#(and (or (not (= (mod ~g2~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g2~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)))] [2022-03-15 19:03:57,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:03:57,696 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:57,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:03:57,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:03:57,696 INFO L87 Difference]: Start difference. First operand 2630 states and 10303 transitions. Second operand has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:58,480 INFO L93 Difference]: Finished difference Result 2901 states and 11147 transitions. [2022-03-15 19:03:58,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:03:58,480 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:03:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:58,486 INFO L225 Difference]: With dead ends: 2901 [2022-03-15 19:03:58,486 INFO L226 Difference]: Without dead ends: 2884 [2022-03-15 19:03:58,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 12 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=401, Invalid=1669, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:03:58,486 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:58,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:03:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2022-03-15 19:03:58,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 2632. [2022-03-15 19:03:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 2631 states have (on average 3.918662105663246) internal successors, (10310), 2631 states have internal predecessors, (10310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 10310 transitions. [2022-03-15 19:03:58,525 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 10310 transitions. Word has length 24 [2022-03-15 19:03:58,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:58,525 INFO L470 AbstractCegarLoop]: Abstraction has 2632 states and 10310 transitions. [2022-03-15 19:03:58,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 10310 transitions. [2022-03-15 19:03:58,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:03:58,529 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:58,529 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:58,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2022-03-15 19:03:58,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:58,749 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:58,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:58,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1778951009, now seen corresponding path program 97 times [2022-03-15 19:03:58,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:58,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482804588] [2022-03-15 19:03:58,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:58,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:59,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:59,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482804588] [2022-03-15 19:03:59,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482804588] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:59,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685940217] [2022-03-15 19:03:59,158 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:03:59,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:59,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:59,159 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:59,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-03-15 19:03:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:59,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:03:59,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:59,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:00,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685940217] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:00,731 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:00,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 26 [2022-03-15 19:04:00,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1021126130] [2022-03-15 19:04:00,731 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:00,733 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:00,743 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 142 transitions. [2022-03-15 19:04:00,743 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:03,648 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [613256#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 613257#(and (or (= ~g2~0 0) (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0)) (not (= ~g2~0 0)))), 613259#(and (= ~d2~0 1) (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= ~pos~0 1) (<= 1 ~pos~0) (= ~g3~0 1)), 613255#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 613260#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 613258#(and (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (<= ~pos~0 4) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:04:03,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:04:03,649 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:03,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:04:03,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:04:03,649 INFO L87 Difference]: Start difference. First operand 2632 states and 10310 transitions. Second operand has 19 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:05,280 INFO L93 Difference]: Finished difference Result 4063 states and 14327 transitions. [2022-03-15 19:04:05,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:04:05,281 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:04:05,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:05,289 INFO L225 Difference]: With dead ends: 4063 [2022-03-15 19:04:05,289 INFO L226 Difference]: Without dead ends: 4056 [2022-03-15 19:04:05,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 58 SyntacticMatches, 18 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=559, Invalid=2521, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:04:05,289 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 251 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:05,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 0 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:04:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2022-03-15 19:04:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 2634. [2022-03-15 19:04:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2633 states have (on average 3.919103684010634) internal successors, (10319), 2633 states have internal predecessors, (10319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 10319 transitions. [2022-03-15 19:04:05,335 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 10319 transitions. Word has length 24 [2022-03-15 19:04:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:05,335 INFO L470 AbstractCegarLoop]: Abstraction has 2634 states and 10319 transitions. [2022-03-15 19:04:05,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 10319 transitions. [2022-03-15 19:04:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:04:05,338 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:05,339 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:05,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2022-03-15 19:04:05,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:05,551 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:05,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:05,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1157597791, now seen corresponding path program 98 times [2022-03-15 19:04:05,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:05,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138204301] [2022-03-15 19:04:05,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:05,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:05,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138204301] [2022-03-15 19:04:05,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138204301] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:05,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323555156] [2022-03-15 19:04:05,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:04:05,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:05,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:05,826 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:05,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-03-15 19:04:06,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:04:06,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:06,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:04:06,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:06,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:04:07,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323555156] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:07,057 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:07,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2022-03-15 19:04:07,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [636477633] [2022-03-15 19:04:07,058 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:07,059 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:07,070 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 146 transitions. [2022-03-15 19:04:07,070 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:09,262 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [622805#(and (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= ~pos~0 1) (<= 1 ~pos~0) (= ~d3~0 1) (= ~g3~0 1)), 622807#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 622806#(and (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 622804#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 19:04:09,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:04:09,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:04:09,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:04:09,263 INFO L87 Difference]: Start difference. First operand 2634 states and 10319 transitions. Second operand has 17 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:10,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:10,517 INFO L93 Difference]: Finished difference Result 3599 states and 13431 transitions. [2022-03-15 19:04:10,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:04:10,517 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:04:10,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:10,524 INFO L225 Difference]: With dead ends: 3599 [2022-03-15 19:04:10,524 INFO L226 Difference]: Without dead ends: 3592 [2022-03-15 19:04:10,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 52 SyntacticMatches, 26 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=655, Invalid=2651, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:04:10,525 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:10,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:04:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2022-03-15 19:04:10,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 2634. [2022-03-15 19:04:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2633 states have (on average 3.919103684010634) internal successors, (10319), 2633 states have internal predecessors, (10319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 10319 transitions. [2022-03-15 19:04:10,584 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 10319 transitions. Word has length 24 [2022-03-15 19:04:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:10,584 INFO L470 AbstractCegarLoop]: Abstraction has 2634 states and 10319 transitions. [2022-03-15 19:04:10,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 10319 transitions. [2022-03-15 19:04:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:04:10,588 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:10,588 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:10,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Forceful destruction successful, exit code 0 [2022-03-15 19:04:10,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2022-03-15 19:04:10,801 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash 523321211, now seen corresponding path program 99 times [2022-03-15 19:04:10,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:10,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964864620] [2022-03-15 19:04:10,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:10,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:11,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:11,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964864620] [2022-03-15 19:04:11,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964864620] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:11,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998438363] [2022-03-15 19:04:11,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:04:11,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:11,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:11,139 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:11,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-03-15 19:04:11,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:04:11,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:11,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:04:11,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:11,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:12,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998438363] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:12,624 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:12,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2022-03-15 19:04:12,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1176723525] [2022-03-15 19:04:12,624 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:12,626 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:12,636 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 128 transitions. [2022-03-15 19:04:12,636 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:14,554 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [631891#(and (or (not (= (mod ~g2~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g2~0 256) 0)) (< 0 (+ ~pos~0 1)))), 631889#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 631892#(and (= ~d2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1))), 631890#(and (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 1) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 3) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0)) (<= ~pos~0 3) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1)) (< 0 (+ ~pos~0 4)))] [2022-03-15 19:04:14,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:04:14,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:14,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:04:14,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:04:14,555 INFO L87 Difference]: Start difference. First operand 2634 states and 10319 transitions. Second operand has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:14,940 INFO L93 Difference]: Finished difference Result 2978 states and 11430 transitions. [2022-03-15 19:04:14,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:04:14,940 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:04:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:14,946 INFO L225 Difference]: With dead ends: 2978 [2022-03-15 19:04:14,946 INFO L226 Difference]: Without dead ends: 2920 [2022-03-15 19:04:14,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 18 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:04:14,947 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:14,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:04:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2022-03-15 19:04:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2628. [2022-03-15 19:04:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2628 states, 2627 states have (on average 3.9128283212790254) internal successors, (10279), 2627 states have internal predecessors, (10279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 10279 transitions. [2022-03-15 19:04:14,984 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 10279 transitions. Word has length 24 [2022-03-15 19:04:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:14,984 INFO L470 AbstractCegarLoop]: Abstraction has 2628 states and 10279 transitions. [2022-03-15 19:04:14,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 10279 transitions. [2022-03-15 19:04:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:04:14,988 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:14,988 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:15,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Forceful destruction successful, exit code 0 [2022-03-15 19:04:15,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:15,205 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:15,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:15,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1617412799, now seen corresponding path program 100 times [2022-03-15 19:04:15,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:15,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164238424] [2022-03-15 19:04:15,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:15,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:15,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:15,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164238424] [2022-03-15 19:04:15,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164238424] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:15,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140392859] [2022-03-15 19:04:15,491 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:04:15,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:15,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:15,492 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:15,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-03-15 19:04:15,674 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:04:15,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:15,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:04:15,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:16,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:16,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:16,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140392859] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:16,973 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:16,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 19:04:16,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2038072174] [2022-03-15 19:04:16,973 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:16,974 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:16,985 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 142 transitions. [2022-03-15 19:04:16,985 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:19,366 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [640297#(and (= ~d2~0 1) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (<= 1 ~pos~0) (= ~d3~0 1)), 640298#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 640296#(and (or (not (= 0 (mod ~d3~0 256))) (< 1 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 2) 0)) (<= ~pos~0 2) (< 0 (+ ~pos~0 3))), 640299#(and (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 1) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 3) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0)) (<= ~pos~0 3) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1)) (< 0 (+ ~pos~0 4)))] [2022-03-15 19:04:19,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:04:19,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:19,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:04:19,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:04:19,367 INFO L87 Difference]: Start difference. First operand 2628 states and 10279 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:19,642 INFO L93 Difference]: Finished difference Result 3011 states and 11577 transitions. [2022-03-15 19:04:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:04:19,643 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:04:19,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:19,649 INFO L225 Difference]: With dead ends: 3011 [2022-03-15 19:04:19,649 INFO L226 Difference]: Without dead ends: 2944 [2022-03-15 19:04:19,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 68 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:04:19,649 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:19,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:04:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2022-03-15 19:04:19,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2598. [2022-03-15 19:04:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2598 states, 2597 states have (on average 3.933769734308818) internal successors, (10216), 2597 states have internal predecessors, (10216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 10216 transitions. [2022-03-15 19:04:19,687 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 10216 transitions. Word has length 24 [2022-03-15 19:04:19,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:19,687 INFO L470 AbstractCegarLoop]: Abstraction has 2598 states and 10216 transitions. [2022-03-15 19:04:19,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 10216 transitions. [2022-03-15 19:04:19,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:04:19,691 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:19,691 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:19,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2022-03-15 19:04:19,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-03-15 19:04:19,899 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:19,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:19,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1638804041, now seen corresponding path program 101 times [2022-03-15 19:04:19,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:19,902 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937849289] [2022-03-15 19:04:19,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:19,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:20,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:20,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937849289] [2022-03-15 19:04:20,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937849289] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:20,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925148494] [2022-03-15 19:04:20,414 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:04:20,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:20,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:20,417 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:20,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-03-15 19:04:20,571 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:04:20,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:20,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:04:20,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:21,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:21,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925148494] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:21,655 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:21,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2022-03-15 19:04:21,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1020243572] [2022-03-15 19:04:21,656 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:21,657 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:21,668 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 145 transitions. [2022-03-15 19:04:21,668 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:24,678 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [648683#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 648680#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 648689#(and (or (<= ~g1~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= 1 ~g1~0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (= ~g3~0 1)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0))), 648620#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 648681#(and (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0)))), 648687#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 648682#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (< 0 (+ ~pos~0 1)))), 648679#(and (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (= (mod ~g1~0 256) 0))), 648690#(and (or (<= ~g1~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= (mod ~g1~0 256) 0) (<= 1 ~g1~0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (= ~g3~0 1)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0))), 648686#(and (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 648678#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 648685#(and (or (= ~g2~0 1) (= (mod ~g1~0 256) 0) (< 0 (+ ~pos~0 1)) (<= 1 ~g1~0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0) (<= ~pos~0 0) (<= 1 ~g1~0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0) (<= (div ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0) (<= (div ~g1~0 256) 0) (< 0 (+ ~pos~0 1))) (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (= (mod ~g1~0 256) 0) (< 0 (+ ~pos~0 1)))), 648688#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 2) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0) (< 1 ~pos~0))), 648684#(and (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (< 0 ~pos~0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (= (mod ~g1~0 256) 0) (<= (div ~g1~0 256) 0) (<= (+ ~pos~0 1) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0) (<= (div ~g1~0 256) 0) (< 0 (+ ~pos~0 2))) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0) (< 0 (+ ~pos~0 2)) (<= 1 ~g1~0)) (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (= (mod ~g1~0 256) 0) (<= (+ ~pos~0 1) 0) (<= 1 ~g1~0))), 648677#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 19:04:24,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:04:24,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:24,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:04:24,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1648, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:04:24,679 INFO L87 Difference]: Start difference. First operand 2598 states and 10216 transitions. Second operand has 29 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:37,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:37,701 INFO L93 Difference]: Finished difference Result 5515 states and 18992 transitions. [2022-03-15 19:04:37,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-03-15 19:04:37,701 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:04:37,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:37,712 INFO L225 Difference]: With dead ends: 5515 [2022-03-15 19:04:37,712 INFO L226 Difference]: Without dead ends: 5474 [2022-03-15 19:04:37,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 51 SyntacticMatches, 14 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9716 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=4738, Invalid=20702, Unknown=0, NotChecked=0, Total=25440 [2022-03-15 19:04:37,714 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 847 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:37,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [847 Valid, 0 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:04:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5474 states. [2022-03-15 19:04:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5474 to 2602. [2022-03-15 19:04:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2601 states have (on average 3.934640522875817) internal successors, (10234), 2601 states have internal predecessors, (10234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10234 transitions. [2022-03-15 19:04:37,765 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10234 transitions. Word has length 24 [2022-03-15 19:04:37,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:37,765 INFO L470 AbstractCegarLoop]: Abstraction has 2602 states and 10234 transitions. [2022-03-15 19:04:37,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10234 transitions. [2022-03-15 19:04:37,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:04:37,769 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:37,769 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:37,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2022-03-15 19:04:37,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-03-15 19:04:37,986 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:37,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:37,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2081703181, now seen corresponding path program 102 times [2022-03-15 19:04:37,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:37,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984801230] [2022-03-15 19:04:37,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:37,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:38,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:38,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984801230] [2022-03-15 19:04:38,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984801230] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:38,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419356593] [2022-03-15 19:04:38,221 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:04:38,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:38,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:38,222 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:38,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-03-15 19:04:38,422 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:04:38,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:38,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:04:38,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:38,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:39,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419356593] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:39,772 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:39,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 19:04:39,772 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [619846493] [2022-03-15 19:04:39,772 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:39,773 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:39,783 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 133 transitions. [2022-03-15 19:04:39,784 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:41,745 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [659805#(and (or (not (= 0 (mod ~d3~0 256))) (< 1 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 2) 0)) (<= ~pos~0 2) (< 0 (+ ~pos~0 3))), 659804#(and (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 1) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 3) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0)) (<= ~pos~0 3) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1)) (< 0 (+ ~pos~0 4))), 659807#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 659806#(and (= ~d2~0 1) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (<= 1 ~pos~0) (= ~d3~0 1)), 659803#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2)))] [2022-03-15 19:04:41,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:04:41,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:41,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:04:41,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:04:41,746 INFO L87 Difference]: Start difference. First operand 2602 states and 10234 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:42,079 INFO L93 Difference]: Finished difference Result 3005 states and 11650 transitions. [2022-03-15 19:04:42,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:04:42,079 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:04:42,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:42,085 INFO L225 Difference]: With dead ends: 3005 [2022-03-15 19:04:42,086 INFO L226 Difference]: Without dead ends: 2770 [2022-03-15 19:04:42,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:04:42,086 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:42,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:04:42,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2022-03-15 19:04:42,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2466. [2022-03-15 19:04:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2465 states have (on average 3.896551724137931) internal successors, (9605), 2465 states have internal predecessors, (9605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 9605 transitions. [2022-03-15 19:04:42,123 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 9605 transitions. Word has length 24 [2022-03-15 19:04:42,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:42,123 INFO L470 AbstractCegarLoop]: Abstraction has 2466 states and 9605 transitions. [2022-03-15 19:04:42,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 9605 transitions. [2022-03-15 19:04:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:04:42,127 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:42,127 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:42,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Forceful destruction successful, exit code 0 [2022-03-15 19:04:42,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable104 [2022-03-15 19:04:42,343 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:42,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1760363105, now seen corresponding path program 103 times [2022-03-15 19:04:42,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:42,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790007224] [2022-03-15 19:04:42,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:42,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:42,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790007224] [2022-03-15 19:04:42,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790007224] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:42,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115898149] [2022-03-15 19:04:42,755 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:04:42,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:42,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:42,756 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:42,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-03-15 19:04:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:42,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:04:42,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:43,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:44,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115898149] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:44,518 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:44,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2022-03-15 19:04:44,518 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [122667195] [2022-03-15 19:04:44,518 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:44,519 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:44,530 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 142 transitions. [2022-03-15 19:04:44,530 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:47,666 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [667919#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 667921#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 667920#(and (or (= ~g2~0 0) (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0)) (not (= ~g2~0 0)))), 667916#(and (or (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (= ~g3~0 1)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0))), 667923#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 667922#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 667917#(and (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~g1~0 256) 0) (= ~g3~0 1)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0))), 667915#(and (or (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 0) (= (mod ~g1~0 256) 0) (<= 3 ~pos~0)) (or (= (mod ~g1~0 256) 0) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0))) (or (<= 1 ~pos~0) (= ~g2~0 0) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= ~g2~0 0) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 0) (<= ~pos~0 3) (= (mod ~g1~0 256) 0))), 667918#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 667924#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 19:04:47,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:04:47,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:47,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:04:47,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1355, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:04:47,667 INFO L87 Difference]: Start difference. First operand 2466 states and 9605 transitions. Second operand has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 23 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:54,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:54,237 INFO L93 Difference]: Finished difference Result 3885 states and 13807 transitions. [2022-03-15 19:04:54,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-15 19:04:54,237 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 23 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:04:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:54,245 INFO L225 Difference]: With dead ends: 3885 [2022-03-15 19:04:54,245 INFO L226 Difference]: Without dead ends: 3878 [2022-03-15 19:04:54,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 54 SyntacticMatches, 17 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3265 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2012, Invalid=9544, Unknown=0, NotChecked=0, Total=11556 [2022-03-15 19:04:54,245 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 706 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:54,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [706 Valid, 0 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:04:54,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2022-03-15 19:04:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 2472. [2022-03-15 19:04:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2471 states have (on average 3.895184135977337) internal successors, (9625), 2471 states have internal predecessors, (9625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 9625 transitions. [2022-03-15 19:04:54,286 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 9625 transitions. Word has length 24 [2022-03-15 19:04:54,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:54,286 INFO L470 AbstractCegarLoop]: Abstraction has 2472 states and 9625 transitions. [2022-03-15 19:04:54,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.782608695652174) internal successors, (87), 23 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 9625 transitions. [2022-03-15 19:04:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:04:54,290 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:54,290 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:54,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2022-03-15 19:04:54,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:54,503 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:54,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:54,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1560710203, now seen corresponding path program 104 times [2022-03-15 19:04:54,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:54,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646806690] [2022-03-15 19:04:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:54,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:54,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646806690] [2022-03-15 19:04:54,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646806690] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:54,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261606283] [2022-03-15 19:04:54,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:04:54,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:54,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:54,775 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:54,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-03-15 19:04:54,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:04:54,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:54,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:04:54,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:55,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:55,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261606283] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:55,905 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:55,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 19:04:55,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [147776218] [2022-03-15 19:04:55,905 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:55,906 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:55,917 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 132 transitions. [2022-03-15 19:04:55,917 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:57,571 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [677060#(and (or (not (= (mod ~g2~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g2~0 256) 0)) (< 0 (+ ~pos~0 1)))), 677058#(and (= ~d2~0 1) (= ~g2~0 1) (<= ~pos~0 1) (= ~d3~0 1) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1))), 677059#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2)))] [2022-03-15 19:04:57,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:04:57,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:57,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:04:57,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:04:57,572 INFO L87 Difference]: Start difference. First operand 2472 states and 9625 transitions. Second operand has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:57,850 INFO L93 Difference]: Finished difference Result 2761 states and 10593 transitions. [2022-03-15 19:04:57,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:04:57,851 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:04:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:57,856 INFO L225 Difference]: With dead ends: 2761 [2022-03-15 19:04:57,856 INFO L226 Difference]: Without dead ends: 2748 [2022-03-15 19:04:57,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 25 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:04:57,857 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:57,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:04:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2022-03-15 19:04:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2470. [2022-03-15 19:04:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2470 states, 2469 states have (on average 3.897529364115026) internal successors, (9623), 2469 states have internal predecessors, (9623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 9623 transitions. [2022-03-15 19:04:57,889 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 9623 transitions. Word has length 24 [2022-03-15 19:04:57,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:57,889 INFO L470 AbstractCegarLoop]: Abstraction has 2470 states and 9623 transitions. [2022-03-15 19:04:57,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:57,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 9623 transitions. [2022-03-15 19:04:57,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:04:57,892 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:57,893 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:57,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Forceful destruction successful, exit code 0 [2022-03-15 19:04:58,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:58,124 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:58,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:58,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2091705051, now seen corresponding path program 105 times [2022-03-15 19:04:58,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:58,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594381002] [2022-03-15 19:04:58,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:58,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:58,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:58,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594381002] [2022-03-15 19:04:58,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594381002] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:58,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716675802] [2022-03-15 19:04:58,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:04:58,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:58,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:58,469 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:58,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-03-15 19:04:58,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:04:58,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:58,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:04:58,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:58,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:04:59,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716675802] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:59,839 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:59,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 27 [2022-03-15 19:04:59,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [835785001] [2022-03-15 19:04:59,840 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:59,841 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:59,853 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 146 transitions. [2022-03-15 19:04:59,853 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:02,937 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [684940#(and (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (<= ~pos~0 4) (= (mod ~g3~0 256) 0))), 684935#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 684934#(and (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~g1~0 256) 0) (= ~g3~0 1)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0))), 684937#(and (or (= ~g2~0 0) (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0)) (not (= ~g2~0 0)))), 684938#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 684941#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 684933#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= (+ ~pos~0 1) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (= ~g3~0 1)) (or (= (+ (- 1) ~d3~0) 0) (= (mod ~g1~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (= (+ (- 1) ~d2~0) 0) (= (mod ~g1~0 256) 0))), 684939#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 684936#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 684942#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 19:05:02,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:05:02,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:02,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:05:02,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1239, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:05:02,938 INFO L87 Difference]: Start difference. First operand 2470 states and 9623 transitions. Second operand has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:08,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:08,711 INFO L93 Difference]: Finished difference Result 4010 states and 14424 transitions. [2022-03-15 19:05:08,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 19:05:08,711 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:05:08,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:08,720 INFO L225 Difference]: With dead ends: 4010 [2022-03-15 19:05:08,720 INFO L226 Difference]: Without dead ends: 3996 [2022-03-15 19:05:08,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 56 SyntacticMatches, 18 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3675 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1877, Invalid=10333, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 19:05:08,722 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 554 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:08,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 0 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:05:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3996 states. [2022-03-15 19:05:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3996 to 2476. [2022-03-15 19:05:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 3.896161616161616) internal successors, (9643), 2475 states have internal predecessors, (9643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 9643 transitions. [2022-03-15 19:05:08,768 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 9643 transitions. Word has length 24 [2022-03-15 19:05:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:08,769 INFO L470 AbstractCegarLoop]: Abstraction has 2476 states and 9643 transitions. [2022-03-15 19:05:08,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 9643 transitions. [2022-03-15 19:05:08,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:05:08,772 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:08,772 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:08,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2022-03-15 19:05:08,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2022-03-15 19:05:08,987 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:05:08,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash 733286555, now seen corresponding path program 106 times [2022-03-15 19:05:08,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:08,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095774387] [2022-03-15 19:05:08,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:08,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:09,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:09,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095774387] [2022-03-15 19:05:09,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095774387] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:09,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816933312] [2022-03-15 19:05:09,397 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:05:09,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:09,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:09,399 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:05:09,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-03-15 19:05:09,591 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:05:09,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:09,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:05:09,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:09,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:10,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816933312] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:10,913 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:10,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2022-03-15 19:05:10,914 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2035927029] [2022-03-15 19:05:10,914 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:10,915 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:10,927 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 150 transitions. [2022-03-15 19:05:10,927 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:14,622 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [694222#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 694228#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1) (= ~g3~0 0)) (or (= ~g2~0 1) (<= 2 ~pos~0) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 0)) (or (= ~g2~0 1) (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 0)) (or (= ~g2~0 1) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (not (= (mod ~g1~0 256) 0)) (not (= ~g3~0 0)))), 694225#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (not (= (mod ~g1~0 256) 0)) (= (mod ~g3~0 256) 0))), 694221#(and (or (= (mod ~d1~0 256) 0) (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (= ~g3~0 1)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0))), 694220#(and (or (not (= (mod ~d1~0 256) 0)) (= (+ (- 1) ~d3~0) 0) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (= ~g3~0 1)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0))), 694227#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0) (= ~g3~0 1)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (= ~g3~0 1) (< 0 (+ ~pos~0 1)))), 694223#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 694219#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 694224#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 694226#(and (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 19:05:14,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:05:14,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:14,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:05:14,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1425, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:05:14,623 INFO L87 Difference]: Start difference. First operand 2476 states and 9643 transitions. Second operand has 24 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 23 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:29,027 INFO L93 Difference]: Finished difference Result 4964 states and 16961 transitions. [2022-03-15 19:05:29,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-03-15 19:05:29,027 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 23 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:05:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:29,039 INFO L225 Difference]: With dead ends: 4964 [2022-03-15 19:05:29,039 INFO L226 Difference]: Without dead ends: 4950 [2022-03-15 19:05:29,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 52 SyntacticMatches, 21 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7664 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=3404, Invalid=18352, Unknown=0, NotChecked=0, Total=21756 [2022-03-15 19:05:29,041 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 654 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:29,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [654 Valid, 0 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:05:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4950 states. [2022-03-15 19:05:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4950 to 2506. [2022-03-15 19:05:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 2505 states have (on average 3.893013972055888) internal successors, (9752), 2505 states have internal predecessors, (9752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9752 transitions. [2022-03-15 19:05:29,095 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 9752 transitions. Word has length 24 [2022-03-15 19:05:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:29,095 INFO L470 AbstractCegarLoop]: Abstraction has 2506 states and 9752 transitions. [2022-03-15 19:05:29,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 23 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 9752 transitions. [2022-03-15 19:05:29,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:05:29,099 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:29,099 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:29,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Forceful destruction successful, exit code 0 [2022-03-15 19:05:29,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:29,316 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:05:29,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:29,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1193101563, now seen corresponding path program 107 times [2022-03-15 19:05:29,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:29,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825813497] [2022-03-15 19:05:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:29,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:29,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:29,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825813497] [2022-03-15 19:05:29,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825813497] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:29,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879575135] [2022-03-15 19:05:29,600 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:05:29,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:29,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:29,601 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:05:29,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2022-03-15 19:05:29,777 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:05:29,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:29,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:05:29,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:30,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:31,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879575135] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:31,292 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:31,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2022-03-15 19:05:31,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [508392680] [2022-03-15 19:05:31,292 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:31,293 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:31,304 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 146 transitions. [2022-03-15 19:05:31,304 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:33,897 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [704583#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 704587#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 704584#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 704586#(and (= ~d2~0 1) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (<= 1 ~pos~0) (= ~d3~0 1) (= ~g3~0 1)), 704585#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:05:33,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:05:33,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:33,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:05:33,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:05:33,898 INFO L87 Difference]: Start difference. First operand 2506 states and 9752 transitions. Second operand has 17 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:34,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:34,388 INFO L93 Difference]: Finished difference Result 3165 states and 11978 transitions. [2022-03-15 19:05:34,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:05:34,388 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:05:34,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:34,394 INFO L225 Difference]: With dead ends: 3165 [2022-03-15 19:05:34,394 INFO L226 Difference]: Without dead ends: 3158 [2022-03-15 19:05:34,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=265, Invalid=1067, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:05:34,394 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:34,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:05:34,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3158 states. [2022-03-15 19:05:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3158 to 2532. [2022-03-15 19:05:34,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 2531 states have (on average 3.8984591070723034) internal successors, (9867), 2531 states have internal predecessors, (9867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 9867 transitions. [2022-03-15 19:05:34,430 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 9867 transitions. Word has length 24 [2022-03-15 19:05:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:34,430 INFO L470 AbstractCegarLoop]: Abstraction has 2532 states and 9867 transitions. [2022-03-15 19:05:34,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 9867 transitions. [2022-03-15 19:05:34,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:05:34,434 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:34,434 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:34,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Forceful destruction successful, exit code 0 [2022-03-15 19:05:34,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:34,651 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:05:34,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:34,651 INFO L85 PathProgramCache]: Analyzing trace with hash -111684897, now seen corresponding path program 108 times [2022-03-15 19:05:34,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:34,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293445164] [2022-03-15 19:05:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:34,963 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:34,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293445164] [2022-03-15 19:05:34,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293445164] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:34,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893106241] [2022-03-15 19:05:34,963 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:05:34,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:34,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:34,965 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:05:34,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-03-15 19:05:35,175 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:05:35,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:35,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:05:35,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:35,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:36,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893106241] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:36,549 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:36,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 26 [2022-03-15 19:05:36,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1881460995] [2022-03-15 19:05:36,549 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:36,551 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:36,563 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 167 transitions. [2022-03-15 19:05:36,563 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:41,288 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [712992#(and (or (<= 2 ~pos~0) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 2) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (<= 6 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 6) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (= (mod ~g3~0 256) 0))), 712993#(and (= ~d2~0 1) (= (mod ~d1~0 256) 0) (= ~g2~0 1) (<= ~pos~0 1) (<= 1 ~pos~0) (= ~d3~0 1) (= ~g3~0 1)), 712994#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 712933#(or (not (<= (mod ~g3~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 712991#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:05:41,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:05:41,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:41,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:05:41,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:05:41,289 INFO L87 Difference]: Start difference. First operand 2532 states and 9867 transitions. Second operand has 18 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:43,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:43,254 INFO L93 Difference]: Finished difference Result 3293 states and 12225 transitions. [2022-03-15 19:05:43,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 19:05:43,255 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:05:43,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:43,293 INFO L225 Difference]: With dead ends: 3293 [2022-03-15 19:05:43,293 INFO L226 Difference]: Without dead ends: 3286 [2022-03-15 19:05:43,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 39 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=677, Invalid=2745, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:05:43,293 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 153 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:43,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 0 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:05:43,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3286 states. [2022-03-15 19:05:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3286 to 2546. [2022-03-15 19:05:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2545 states have (on average 3.9041257367387034) internal successors, (9936), 2545 states have internal predecessors, (9936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 9936 transitions. [2022-03-15 19:05:43,329 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 9936 transitions. Word has length 24 [2022-03-15 19:05:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:43,330 INFO L470 AbstractCegarLoop]: Abstraction has 2546 states and 9936 transitions. [2022-03-15 19:05:43,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 9936 transitions. [2022-03-15 19:05:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:05:43,333 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:43,333 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:43,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Ended with exit code 0 [2022-03-15 19:05:43,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:43,551 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:05:43,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:43,568 INFO L85 PathProgramCache]: Analyzing trace with hash -473465667, now seen corresponding path program 109 times [2022-03-15 19:05:43,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:43,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400245174] [2022-03-15 19:05:43,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:43,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:43,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:43,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400245174] [2022-03-15 19:05:43,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400245174] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:43,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811813612] [2022-03-15 19:05:43,886 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:05:43,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:43,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:43,887 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:05:43,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-03-15 19:05:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:44,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:05:44,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:44,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:45,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811813612] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:45,626 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:45,626 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 31 [2022-03-15 19:05:45,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [586432863] [2022-03-15 19:05:45,626 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:45,628 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:45,636 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 116 transitions. [2022-03-15 19:05:45,636 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:47,318 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [721546#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 721605#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 721608#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 721612#(and (or (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0))), 721614#(and (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 721607#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 721606#(and (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 721609#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 721610#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (= ~g2~0 1) (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 721613#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0))), 721611#(and (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:05:47,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:05:47,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:47,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:05:47,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1445, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:05:47,319 INFO L87 Difference]: Start difference. First operand 2546 states and 9936 transitions. Second operand has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:48,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:48,632 INFO L93 Difference]: Finished difference Result 2879 states and 11001 transitions. [2022-03-15 19:05:48,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:05:48,632 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:05:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:48,639 INFO L225 Difference]: With dead ends: 2879 [2022-03-15 19:05:48,639 INFO L226 Difference]: Without dead ends: 2866 [2022-03-15 19:05:48,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 42 SyntacticMatches, 12 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=811, Invalid=3611, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:05:48,640 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 236 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:48,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 0 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:05:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2022-03-15 19:05:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 2548. [2022-03-15 19:05:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 2547 states have (on average 3.9030231645072635) internal successors, (9941), 2547 states have internal predecessors, (9941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 9941 transitions. [2022-03-15 19:05:48,684 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 9941 transitions. Word has length 24 [2022-03-15 19:05:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:48,684 INFO L470 AbstractCegarLoop]: Abstraction has 2548 states and 9941 transitions. [2022-03-15 19:05:48,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 9941 transitions. [2022-03-15 19:05:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:05:48,689 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:48,689 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:48,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Forceful destruction successful, exit code 0 [2022-03-15 19:05:48,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2022-03-15 19:05:48,903 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:05:48,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:48,904 INFO L85 PathProgramCache]: Analyzing trace with hash -485854137, now seen corresponding path program 110 times [2022-03-15 19:05:48,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:48,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938931208] [2022-03-15 19:05:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:48,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:49,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:49,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938931208] [2022-03-15 19:05:49,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938931208] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:49,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539191083] [2022-03-15 19:05:49,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:05:49,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:49,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:49,168 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:05:49,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-03-15 19:05:49,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:05:49,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:49,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:05:49,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:50,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:50,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539191083] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:50,781 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:50,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2022-03-15 19:05:50,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1469933861] [2022-03-15 19:05:50,781 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:50,782 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:50,793 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 152 transitions. [2022-03-15 19:05:50,794 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:53,827 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [729809#(and (= 0 (mod ~d3~0 256)) (<= 1 ~pos~0) (<= ~pos~0 3) (or (not (= (mod ~d1~0 256) 0)) (<= 3 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1))), 729810#(and (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 729808#(and (<= ~pos~0 1) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0)) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (<= 0 (+ ~pos~0 1))), 729807#(and (or (not (= 0 (mod ~d3~0 256))) (< 1 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 2) 0)) (<= ~pos~0 2) (< 0 (+ ~pos~0 3)))] [2022-03-15 19:05:53,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:05:53,827 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:53,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:05:53,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:05:53,827 INFO L87 Difference]: Start difference. First operand 2548 states and 9941 transitions. Second operand has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:54,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:54,157 INFO L93 Difference]: Finished difference Result 2815 states and 10813 transitions. [2022-03-15 19:05:54,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:05:54,158 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:05:54,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:54,162 INFO L225 Difference]: With dead ends: 2815 [2022-03-15 19:05:54,162 INFO L226 Difference]: Without dead ends: 2152 [2022-03-15 19:05:54,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 56 SyntacticMatches, 21 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:05:54,162 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:54,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:05:54,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2022-03-15 19:05:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 1574. [2022-03-15 19:05:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1573 states have (on average 3.716465352828989) internal successors, (5846), 1573 states have internal predecessors, (5846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 5846 transitions. [2022-03-15 19:05:54,184 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 5846 transitions. Word has length 24 [2022-03-15 19:05:54,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:54,184 INFO L470 AbstractCegarLoop]: Abstraction has 1574 states and 5846 transitions. [2022-03-15 19:05:54,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 5846 transitions. [2022-03-15 19:05:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:05:54,186 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:54,186 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:54,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2022-03-15 19:05:54,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2022-03-15 19:05:54,406 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:05:54,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:54,406 INFO L85 PathProgramCache]: Analyzing trace with hash -522436227, now seen corresponding path program 111 times [2022-03-15 19:05:54,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:54,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617830213] [2022-03-15 19:05:54,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:54,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:54,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:54,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617830213] [2022-03-15 19:05:54,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617830213] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:54,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046253692] [2022-03-15 19:05:54,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:05:54,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:54,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:54,659 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:05:54,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2022-03-15 19:05:54,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:05:54,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:54,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:05:54,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:55,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:56,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046253692] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:56,074 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:56,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2022-03-15 19:05:56,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [892713695] [2022-03-15 19:05:56,075 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:56,076 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:56,086 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 131 transitions. [2022-03-15 19:05:56,086 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:58,402 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [735947#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 735944#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 735956#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0))), 735953#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0))) (or (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (= ~d2~0 1) (not (= (mod ~g3~0 256) 0))) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 735948#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 735945#(and (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 735957#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 735950#(and (or (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)) (<= 3 ~pos~0)) (or (= ~g2~0 0) (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (= ~g2~0 0) (<= ~pos~0 3) (not (= (mod ~g3~0 256) 0))) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0)) (not (= ~g2~0 0)))), 735951#(and (or (<= (div ~d1~0 256) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 1 ~d1~0)) (or (= ~g2~0 0) (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0)) (not (= ~g2~0 0)))), 735886#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 735954#(and (or (not (= 0 (mod ~d3~0 256))) (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0))), 735955#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0))), 735949#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (= ~g2~0 1) (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 735952#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)) (<= 3 ~pos~0)) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= ~pos~0 3) (not (= (mod ~g3~0 256) 0))) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0))) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0)) (not (= ~g2~0 0)))), 735946#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 19:05:58,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:05:58,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:58,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:05:58,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1666, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:05:58,403 INFO L87 Difference]: Start difference. First operand 1574 states and 5846 transitions. Second operand has 27 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 26 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:02,304 INFO L93 Difference]: Finished difference Result 3296 states and 11667 transitions. [2022-03-15 19:06:02,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-15 19:06:02,304 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 26 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:06:02,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:02,311 INFO L225 Difference]: With dead ends: 3296 [2022-03-15 19:06:02,311 INFO L226 Difference]: Without dead ends: 3266 [2022-03-15 19:06:02,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4073 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1989, Invalid=9783, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 19:06:02,312 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 618 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:02,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [618 Valid, 0 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:06:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2022-03-15 19:06:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 1584. [2022-03-15 19:06:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1583 states have (on average 3.7163613392293113) internal successors, (5883), 1583 states have internal predecessors, (5883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 5883 transitions. [2022-03-15 19:06:02,341 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 5883 transitions. Word has length 24 [2022-03-15 19:06:02,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:02,342 INFO L470 AbstractCegarLoop]: Abstraction has 1584 states and 5883 transitions. [2022-03-15 19:06:02,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 26 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:02,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 5883 transitions. [2022-03-15 19:06:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:06:02,344 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:02,345 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:02,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:02,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2022-03-15 19:06:02,562 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:02,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1451515765, now seen corresponding path program 112 times [2022-03-15 19:06:02,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:02,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323440176] [2022-03-15 19:06:02,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:02,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:02,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:02,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323440176] [2022-03-15 19:06:02,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323440176] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:02,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658513307] [2022-03-15 19:06:02,749 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:06:02,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:02,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:02,750 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:02,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2022-03-15 19:06:02,929 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:06:02,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:02,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:06:02,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:03,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:04,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658513307] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:04,092 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:04,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2022-03-15 19:06:04,092 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [198326875] [2022-03-15 19:06:04,092 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:04,093 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:04,105 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 185 transitions. [2022-03-15 19:06:04,105 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:07,527 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [742713#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 0) (<= 0 ~pos~0)), 742712#(and (= ~d2~0 1) (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 1) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 3 ~pos~0)) (<= 0 (+ ~pos~0 1)) (<= ~pos~0 3) (= ~d1~0 0)), 742714#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (<= ~pos~0 0) (<= 0 ~pos~0))] [2022-03-15 19:06:07,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:06:07,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:07,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:06:07,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=628, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:06:07,528 INFO L87 Difference]: Start difference. First operand 1584 states and 5883 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:07,784 INFO L93 Difference]: Finished difference Result 1771 states and 6489 transitions. [2022-03-15 19:06:07,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:06:07,784 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:06:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:07,788 INFO L225 Difference]: With dead ends: 1771 [2022-03-15 19:06:07,788 INFO L226 Difference]: Without dead ends: 1744 [2022-03-15 19:06:07,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 54 SyntacticMatches, 39 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=628, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:06:07,788 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:07,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:06:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2022-03-15 19:06:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1606. [2022-03-15 19:06:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 3.71588785046729) internal successors, (5964), 1605 states have internal predecessors, (5964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 5964 transitions. [2022-03-15 19:06:07,810 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 5964 transitions. Word has length 24 [2022-03-15 19:06:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:07,810 INFO L470 AbstractCegarLoop]: Abstraction has 1606 states and 5964 transitions. [2022-03-15 19:06:07,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 5964 transitions. [2022-03-15 19:06:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:06:07,812 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:07,812 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:07,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:08,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2022-03-15 19:06:08,030 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:08,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:08,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1584347893, now seen corresponding path program 113 times [2022-03-15 19:06:08,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:08,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701491823] [2022-03-15 19:06:08,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:08,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:08,282 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:08,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:08,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701491823] [2022-03-15 19:06:08,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701491823] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:08,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669312736] [2022-03-15 19:06:08,282 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:06:08,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:08,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:08,283 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:08,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2022-03-15 19:06:08,501 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:06:08,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:08,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:06:08,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:08,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:09,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669312736] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:09,604 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:09,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2022-03-15 19:06:09,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [608383040] [2022-03-15 19:06:09,605 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:09,606 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:09,616 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 143 transitions. [2022-03-15 19:06:09,616 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:11,580 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [747865#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 747871#(and (or (<= (div ~d1~0 256) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 1 ~d1~0)) (or (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (<= 2 ~pos~0) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 2) (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0)))), 747873#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (= ~d2~0 1) (not (= (mod ~g3~0 256) 0))) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 747877#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 747874#(and (or (not (= 0 (mod ~d3~0 256))) (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0))), 747809#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 747872#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (= ~g2~0 0) (not (= (mod ~g3~0 256) 0)) (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (or (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (<= ~pos~0 3) (not (= (mod ~g3~0 256) 0))) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0))) (or (not (= (+ (* (- 256) (div ~d2~0 256)) ~d2~0) 0)) (not (= (mod ~g3~0 256) 0)) (<= 3 ~pos~0))), 747876#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0))), 747867#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 747875#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0))), 747868#(and (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 747869#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 747866#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 747870#(and (or (<= (div ~d1~0 256) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (<= 1 ~d1~0)) (or (not (= (mod ~g3~0 256) 0)) (<= 0 ~pos~0)) (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)))] [2022-03-15 19:06:11,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:06:11,581 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:11,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:06:11,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1412, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:06:11,581 INFO L87 Difference]: Start difference. First operand 1606 states and 5964 transitions. Second operand has 26 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:15,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:15,727 INFO L93 Difference]: Finished difference Result 3652 states and 12916 transitions. [2022-03-15 19:06:15,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-15 19:06:15,727 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:06:15,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:15,734 INFO L225 Difference]: With dead ends: 3652 [2022-03-15 19:06:15,735 INFO L226 Difference]: Without dead ends: 3624 [2022-03-15 19:06:15,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1207, Invalid=6983, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 19:06:15,736 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 733 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:15,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [733 Valid, 0 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:06:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3624 states. [2022-03-15 19:06:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3624 to 1796. [2022-03-15 19:06:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1795 states have (on average 3.7799442896935935) internal successors, (6785), 1795 states have internal predecessors, (6785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 6785 transitions. [2022-03-15 19:06:15,775 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 6785 transitions. Word has length 24 [2022-03-15 19:06:15,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:15,776 INFO L470 AbstractCegarLoop]: Abstraction has 1796 states and 6785 transitions. [2022-03-15 19:06:15,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 6785 transitions. [2022-03-15 19:06:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:06:15,778 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:15,778 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:15,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:15,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:15,996 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:15,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1735954393, now seen corresponding path program 114 times [2022-03-15 19:06:15,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:15,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228266893] [2022-03-15 19:06:15,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:15,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:16,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:16,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228266893] [2022-03-15 19:06:16,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228266893] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:16,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677100016] [2022-03-15 19:06:16,417 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:06:16,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:16,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:16,418 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:16,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-03-15 19:06:16,602 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:06:16,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:16,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:06:16,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:17,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:18,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677100016] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:18,371 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:18,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 19:06:18,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1607759102] [2022-03-15 19:06:18,371 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:18,373 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:18,381 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 126 transitions. [2022-03-15 19:06:18,381 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:21,077 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [755395#(and (or (not (= 0 (mod ~d3~0 256))) (<= 5 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 5) (= (mod ~g3~0 256) 0))), 755393#(and (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (<= 2 ~pos~0) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 2) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0))) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0)) (not (= ~g2~0 0)))), 755398#(and (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0))) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (not (= (mod ~d1~0 256) 0)) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (<= 3 ~pos~0)) (or (<= ~pos~0 3) (not (= (* (div ~d2~0 256) 256) ~d2~0))) (or (= ~g2~0 1) (= ~g2~0 0)) (or (<= 1 ~pos~0) (not (= (* (div ~d2~0 256) 256) ~d2~0)))), 755394#(and (or (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0))), 755392#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 755397#(and (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 755396#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 755391#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 19:06:21,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:06:21,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:21,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:06:21,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1334, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:06:21,078 INFO L87 Difference]: Start difference. First operand 1796 states and 6785 transitions. Second operand has 21 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:24,757 INFO L93 Difference]: Finished difference Result 2297 states and 8391 transitions. [2022-03-15 19:06:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 19:06:24,757 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:06:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:24,762 INFO L225 Difference]: With dead ends: 2297 [2022-03-15 19:06:24,762 INFO L226 Difference]: Without dead ends: 2290 [2022-03-15 19:06:24,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 48 SyntacticMatches, 13 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2309 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1232, Invalid=5574, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 19:06:24,763 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 300 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:24,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 0 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:06:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2022-03-15 19:06:24,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 1810. [2022-03-15 19:06:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1809 states have (on average 3.783305693753455) internal successors, (6844), 1809 states have internal predecessors, (6844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:24,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 6844 transitions. [2022-03-15 19:06:24,791 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 6844 transitions. Word has length 24 [2022-03-15 19:06:24,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:24,791 INFO L470 AbstractCegarLoop]: Abstraction has 1810 states and 6844 transitions. [2022-03-15 19:06:24,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 6844 transitions. [2022-03-15 19:06:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:06:24,794 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:24,794 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:24,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:25,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116,115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:25,007 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:25,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:25,007 INFO L85 PathProgramCache]: Analyzing trace with hash 762060405, now seen corresponding path program 115 times [2022-03-15 19:06:25,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:25,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688353681] [2022-03-15 19:06:25,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:25,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:25,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:25,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:25,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688353681] [2022-03-15 19:06:25,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688353681] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:25,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173631330] [2022-03-15 19:06:25,371 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:06:25,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:25,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:25,372 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:25,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2022-03-15 19:06:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:25,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:06:25,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:26,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:26,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173631330] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:26,761 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:26,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2022-03-15 19:06:26,761 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1589725161] [2022-03-15 19:06:26,761 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:26,762 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:26,770 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 116 transitions. [2022-03-15 19:06:26,770 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:28,176 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [761574#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 761573#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 761572#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 761577#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0))), 761575#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 761576#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0))), 761579#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 761578#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:06:28,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:06:28,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:28,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:06:28,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1395, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:06:28,177 INFO L87 Difference]: Start difference. First operand 1810 states and 6844 transitions. Second operand has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:29,236 INFO L93 Difference]: Finished difference Result 2291 states and 8343 transitions. [2022-03-15 19:06:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:06:29,236 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:06:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:29,241 INFO L225 Difference]: With dead ends: 2291 [2022-03-15 19:06:29,241 INFO L226 Difference]: Without dead ends: 2278 [2022-03-15 19:06:29,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=667, Invalid=3115, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:06:29,241 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:29,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:06:29,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2022-03-15 19:06:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 1808. [2022-03-15 19:06:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 3.784726065301605) internal successors, (6839), 1807 states have internal predecessors, (6839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 6839 transitions. [2022-03-15 19:06:29,266 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 6839 transitions. Word has length 24 [2022-03-15 19:06:29,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:29,266 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 6839 transitions. [2022-03-15 19:06:29,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 6839 transitions. [2022-03-15 19:06:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:06:29,269 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:29,269 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:29,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Ended with exit code 0 [2022-03-15 19:06:29,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable117 [2022-03-15 19:06:29,484 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:29,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:29,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1293055253, now seen corresponding path program 116 times [2022-03-15 19:06:29,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:29,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461493353] [2022-03-15 19:06:29,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:29,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:29,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:29,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461493353] [2022-03-15 19:06:29,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461493353] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:29,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350959682] [2022-03-15 19:06:29,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:06:29,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:29,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:29,935 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:29,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2022-03-15 19:06:30,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:06:30,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:30,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:06:30,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:30,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:31,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350959682] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:31,737 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:31,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 19:06:31,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1805918559] [2022-03-15 19:06:31,737 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:31,738 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:31,747 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 130 transitions. [2022-03-15 19:06:31,747 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:34,555 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [767701#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 767702#(and (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (<= 2 ~pos~0) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0))) (or (<= ~pos~0 2) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0))) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0)) (not (= ~g2~0 0)))), 767700#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 767705#(and (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 4) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0))), 767703#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 767704#(and (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 767698#(and (or (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0))), 767699#(and (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:06:34,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:06:34,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:34,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:06:34,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1349, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:06:34,555 INFO L87 Difference]: Start difference. First operand 1808 states and 6839 transitions. Second operand has 21 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:36,724 INFO L93 Difference]: Finished difference Result 2613 states and 9442 transitions. [2022-03-15 19:06:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 19:06:36,724 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:06:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:36,729 INFO L225 Difference]: With dead ends: 2613 [2022-03-15 19:06:36,729 INFO L226 Difference]: Without dead ends: 2606 [2022-03-15 19:06:36,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 50 SyntacticMatches, 13 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1338 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=907, Invalid=4205, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:06:36,730 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 262 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:36,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 0 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:06:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2022-03-15 19:06:36,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 1814. [2022-03-15 19:06:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1813 states have (on average 3.7848869277440707) internal successors, (6862), 1813 states have internal predecessors, (6862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 6862 transitions. [2022-03-15 19:06:36,758 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 6862 transitions. Word has length 24 [2022-03-15 19:06:36,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:36,758 INFO L470 AbstractCegarLoop]: Abstraction has 1814 states and 6862 transitions. [2022-03-15 19:06:36,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 20 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:36,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 6862 transitions. [2022-03-15 19:06:36,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:06:36,761 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:36,761 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:36,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:36,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118,117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:36,978 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:36,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:36,979 INFO L85 PathProgramCache]: Analyzing trace with hash -65363243, now seen corresponding path program 117 times [2022-03-15 19:06:36,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:36,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361290892] [2022-03-15 19:06:36,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:36,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:37,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:37,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361290892] [2022-03-15 19:06:37,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361290892] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:37,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317313689] [2022-03-15 19:06:37,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:06:37,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:37,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:37,287 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:37,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2022-03-15 19:06:37,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:06:37,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:37,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:06:37,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:38,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:39,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317313689] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:39,306 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:39,306 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2022-03-15 19:06:39,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [389193214] [2022-03-15 19:06:39,307 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:39,308 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:39,318 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 134 transitions. [2022-03-15 19:06:39,318 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:41,869 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [774182#(and (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= (+ (- 1) ~d2~0) 0) (<= ~pos~0 0) (not (= (+ ~d3~0 (* (div ~d3~0 256) (- 256))) 0)) (<= 0 ~pos~0)), 774183#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 774181#(and (or (not (= 0 (mod ~d3~0 256))) (< 1 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= (+ ~pos~0 2) 0)) (<= ~pos~0 2) (< 0 (+ ~pos~0 3)))] [2022-03-15 19:06:41,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:06:41,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:41,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:06:41,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1031, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:06:41,869 INFO L87 Difference]: Start difference. First operand 1814 states and 6862 transitions. Second operand has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:42,176 INFO L93 Difference]: Finished difference Result 2109 states and 7851 transitions. [2022-03-15 19:06:42,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:06:42,176 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:06:42,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:42,181 INFO L225 Difference]: With dead ends: 2109 [2022-03-15 19:06:42,181 INFO L226 Difference]: Without dead ends: 2072 [2022-03-15 19:06:42,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 44 SyntacticMatches, 24 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=339, Invalid=1221, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:06:42,181 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:42,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:06:42,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2022-03-15 19:06:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1830. [2022-03-15 19:06:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1829 states have (on average 3.7823947512301803) internal successors, (6918), 1829 states have internal predecessors, (6918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 6918 transitions. [2022-03-15 19:06:42,208 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 6918 transitions. Word has length 24 [2022-03-15 19:06:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:42,217 INFO L470 AbstractCegarLoop]: Abstraction has 1830 states and 6918 transitions. [2022-03-15 19:06:42,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 6918 transitions. [2022-03-15 19:06:42,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:06:42,221 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:42,221 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:42,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:42,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:42,431 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:42,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:42,432 INFO L85 PathProgramCache]: Analyzing trace with hash -699639823, now seen corresponding path program 118 times [2022-03-15 19:06:42,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:42,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142579279] [2022-03-15 19:06:42,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:42,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:42,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:42,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142579279] [2022-03-15 19:06:42,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142579279] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:42,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205990900] [2022-03-15 19:06:42,749 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:06:42,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:42,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:42,764 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:42,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2022-03-15 19:06:42,953 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:06:42,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:42,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:06:42,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:43,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:44,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205990900] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:44,628 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:44,628 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2022-03-15 19:06:44,628 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [969339753] [2022-03-15 19:06:44,629 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:44,630 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:44,638 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 116 transitions. [2022-03-15 19:06:44,638 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:47,647 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [780137#(and (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0))), 780073#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 780142#(and (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (= (mod ~g1~0 256) 0) (not (= (mod ~g3~0 256) 0)))), 780144#(and (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (= (mod ~g1~0 256) 0) (<= (+ ~pos~0 1) 0) (= ~g1~0 1)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0) (= ~g1~0 1) (< 0 (+ ~pos~0 2))) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (< 0 ~pos~0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= ~pos~0 1) (= (mod ~g1~0 256) 0))), 780143#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 3) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0))), 780132#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 780138#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 780136#(and (or (= (mod ~g1~0 256) 0) (= ~g1~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g1~0 256) 0) (= (mod ~g3~0 256) 0))), 780135#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g1~0 1) (= ~g1~0 0) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0))), 780141#(and (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g1~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 780134#(and (or (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~g3~0 256) 0)) (or (= ~g1~0 1) (= ~g1~0 0) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0))), 780133#(and (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (= (mod ~g1~0 256) 0))), 780139#(and (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (< 0 (mod ~g2~0 256)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 780140#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 19:06:47,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:06:47,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:47,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:06:47,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=1824, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:06:47,648 INFO L87 Difference]: Start difference. First operand 1830 states and 6918 transitions. Second operand has 27 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:52,010 INFO L93 Difference]: Finished difference Result 3611 states and 12510 transitions. [2022-03-15 19:06:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-03-15 19:06:52,010 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:06:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:52,017 INFO L225 Difference]: With dead ends: 3611 [2022-03-15 19:06:52,017 INFO L226 Difference]: Without dead ends: 3604 [2022-03-15 19:06:52,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 39 SyntacticMatches, 11 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4201 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2307, Invalid=10125, Unknown=0, NotChecked=0, Total=12432 [2022-03-15 19:06:52,018 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 447 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:52,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 0 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:06:52,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3604 states. [2022-03-15 19:06:52,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3604 to 1864. [2022-03-15 19:06:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1863 states have (on average 3.7901234567901234) internal successors, (7061), 1863 states have internal predecessors, (7061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 7061 transitions. [2022-03-15 19:06:52,051 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 7061 transitions. Word has length 24 [2022-03-15 19:06:52,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:52,051 INFO L470 AbstractCegarLoop]: Abstraction has 1864 states and 7061 transitions. [2022-03-15 19:06:52,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 26 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 7061 transitions. [2022-03-15 19:06:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:06:52,054 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:52,054 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:52,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Ended with exit code 0 [2022-03-15 19:06:52,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:52,271 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:52,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:52,272 INFO L85 PathProgramCache]: Analyzing trace with hash 394451765, now seen corresponding path program 119 times [2022-03-15 19:06:52,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:52,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854743422] [2022-03-15 19:06:52,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:52,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:52,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:52,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854743422] [2022-03-15 19:06:52,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854743422] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:52,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763149709] [2022-03-15 19:06:52,483 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:06:52,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:52,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:52,484 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:52,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2022-03-15 19:06:52,673 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:06:52,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:52,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:06:52,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:53,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:54,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763149709] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:54,380 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:54,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2022-03-15 19:06:54,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1197745366] [2022-03-15 19:06:54,380 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:54,381 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:54,390 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 130 transitions. [2022-03-15 19:06:54,390 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:56,733 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [787782#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 787781#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 787787#(and (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (< 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= (mod ~g3~0 256) 0))), 787785#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0))), 787784#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~d1~0 0) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g3~0 256) 0))), 787783#(and (or (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~g3~0 256) 0)) (or (= ~d1~0 0) (= (mod ~g3~0 256) 0)) (or (= (+ (- 1) ~d2~0) 0) (= (mod ~g3~0 256) 0)) (or (<= 3 ~pos~0) (= (mod ~g3~0 256) 0))), 787786#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~d3~0 1) (<= ~pos~0 0) (<= 0 ~pos~0))] [2022-03-15 19:06:56,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:06:56,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:56,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:06:56,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1103, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:06:56,734 INFO L87 Difference]: Start difference. First operand 1864 states and 7061 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:57,496 INFO L93 Difference]: Finished difference Result 2850 states and 10735 transitions. [2022-03-15 19:06:57,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:06:57,496 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:06:57,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:57,501 INFO L225 Difference]: With dead ends: 2850 [2022-03-15 19:06:57,501 INFO L226 Difference]: Without dead ends: 2766 [2022-03-15 19:06:57,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=526, Invalid=2024, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:06:57,502 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 146 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:57,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 0 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:06:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2022-03-15 19:06:57,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 2004. [2022-03-15 19:06:57,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 2003 states have (on average 3.8247628557164255) internal successors, (7661), 2003 states have internal predecessors, (7661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 7661 transitions. [2022-03-15 19:06:57,531 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 7661 transitions. Word has length 24 [2022-03-15 19:06:57,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:57,531 INFO L470 AbstractCegarLoop]: Abstraction has 2004 states and 7661 transitions. [2022-03-15 19:06:57,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 7661 transitions. [2022-03-15 19:06:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:06:57,534 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:57,534 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:57,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:57,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:57,747 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:57,747 INFO L85 PathProgramCache]: Analyzing trace with hash 448083801, now seen corresponding path program 120 times [2022-03-15 19:06:57,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:57,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725909817] [2022-03-15 19:06:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:57,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:58,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:58,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725909817] [2022-03-15 19:06:58,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725909817] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:58,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978947949] [2022-03-15 19:06:58,047 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:06:58,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:58,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:58,048 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:58,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2022-03-15 19:06:58,238 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:06:58,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:58,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:06:58,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:58,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:59,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978947949] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:59,674 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:59,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 19:06:59,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1517105095] [2022-03-15 19:06:59,674 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:59,676 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:59,685 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 139 transitions. [2022-03-15 19:06:59,685 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:02,475 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [794846#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 5 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 5) (= (mod ~g3~0 256) 0))), 794851#(and (or (= 0 (mod ~d3~0 256)) (= ~g2~0 0) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 0) (<= 2 ~pos~0) (= (mod ~g3~0 256) 0))), 794845#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0))), 794848#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 794850#(and (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (<= ~pos~0 4) (= (mod ~g3~0 256) 0))), 794843#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 794844#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 794847#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 794849#(and (or (= ~g2~0 0) (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0)) (not (= ~g2~0 0))))] [2022-03-15 19:07:02,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:07:02,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:02,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:07:02,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:07:02,476 INFO L87 Difference]: Start difference. First operand 2004 states and 7661 transitions. Second operand has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:05,448 INFO L93 Difference]: Finished difference Result 2896 states and 10388 transitions. [2022-03-15 19:07:05,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 19:07:05,448 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:07:05,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:05,454 INFO L225 Difference]: With dead ends: 2896 [2022-03-15 19:07:05,454 INFO L226 Difference]: Without dead ends: 2882 [2022-03-15 19:07:05,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 53 SyntacticMatches, 13 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1591 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=900, Invalid=5420, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 19:07:05,455 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 299 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:05,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 0 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1730 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:07:05,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2022-03-15 19:07:05,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2010. [2022-03-15 19:07:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 2009 states have (on average 3.8242906918865107) internal successors, (7683), 2009 states have internal predecessors, (7683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:05,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 7683 transitions. [2022-03-15 19:07:05,491 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 7683 transitions. Word has length 24 [2022-03-15 19:07:05,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:05,491 INFO L470 AbstractCegarLoop]: Abstraction has 2010 states and 7683 transitions. [2022-03-15 19:07:05,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 7683 transitions. [2022-03-15 19:07:05,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:07:05,494 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:05,494 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:05,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:05,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2022-03-15 19:07:05,703 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:05,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:05,703 INFO L85 PathProgramCache]: Analyzing trace with hash -910334695, now seen corresponding path program 121 times [2022-03-15 19:07:05,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:05,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292232743] [2022-03-15 19:07:05,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:05,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:05,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:05,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292232743] [2022-03-15 19:07:05,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292232743] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:05,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717749668] [2022-03-15 19:07:05,994 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:07:05,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:05,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:05,996 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:05,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2022-03-15 19:07:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:06,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:07:06,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:06,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:07,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717749668] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:07,566 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:07,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 19:07:07,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [772069635] [2022-03-15 19:07:07,566 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:07,567 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:07,577 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 143 transitions. [2022-03-15 19:07:07,577 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:10,959 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [802020#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 802015#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 802019#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 802017#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 5 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 5) (= (mod ~g3~0 256) 0))), 802018#(and (or (<= ~pos~0 6) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 6 ~pos~0) (= (mod ~g3~0 256) 0)) (or (<= 2 ~pos~0) (= (mod ~g3~0 256) 0))), 802016#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0))), 802021#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:07:10,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:07:10,959 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:10,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:07:10,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1265, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:07:10,960 INFO L87 Difference]: Start difference. First operand 2010 states and 7683 transitions. Second operand has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:12,685 INFO L93 Difference]: Finished difference Result 2585 states and 9522 transitions. [2022-03-15 19:07:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:07:12,685 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:07:12,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:12,690 INFO L225 Difference]: With dead ends: 2585 [2022-03-15 19:07:12,690 INFO L226 Difference]: Without dead ends: 2578 [2022-03-15 19:07:12,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 48 SyntacticMatches, 22 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=779, Invalid=3381, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 19:07:12,691 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:12,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:07:12,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2022-03-15 19:07:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2010. [2022-03-15 19:07:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 2009 states have (on average 3.8242906918865107) internal successors, (7683), 2009 states have internal predecessors, (7683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 7683 transitions. [2022-03-15 19:07:12,720 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 7683 transitions. Word has length 24 [2022-03-15 19:07:12,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:12,720 INFO L470 AbstractCegarLoop]: Abstraction has 2010 states and 7683 transitions. [2022-03-15 19:07:12,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 7683 transitions. [2022-03-15 19:07:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:07:12,723 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:12,723 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:12,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:12,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2022-03-15 19:07:12,940 INFO L402 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:12,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:12,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1387256605, now seen corresponding path program 122 times [2022-03-15 19:07:12,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:12,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550462815] [2022-03-15 19:07:12,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:12,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:13,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:13,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550462815] [2022-03-15 19:07:13,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550462815] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:13,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056164139] [2022-03-15 19:07:13,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:07:13,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:13,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:13,302 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:13,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2022-03-15 19:07:13,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:07:13,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:13,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:07:13,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:14,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:15,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056164139] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:15,289 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:15,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 19:07:15,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [946952009] [2022-03-15 19:07:15,290 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:15,291 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:15,302 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 165 transitions. [2022-03-15 19:07:15,302 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:20,066 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [808852#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0))), 808853#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0))), 808851#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 3) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 3 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0))), 808854#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 808849#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 808850#(and (or (= 0 (mod ~d3~0 256)) (< 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0))), 808848#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))))] [2022-03-15 19:07:20,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:07:20,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:20,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:07:20,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1251, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:07:20,066 INFO L87 Difference]: Start difference. First operand 2010 states and 7683 transitions. Second operand has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:24,068 INFO L93 Difference]: Finished difference Result 2743 states and 10214 transitions. [2022-03-15 19:07:24,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 19:07:24,068 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:07:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:24,074 INFO L225 Difference]: With dead ends: 2743 [2022-03-15 19:07:24,074 INFO L226 Difference]: Without dead ends: 2718 [2022-03-15 19:07:24,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 53 SyntacticMatches, 25 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2249 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1191, Invalid=4815, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 19:07:24,074 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 257 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:24,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 0 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:07:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2022-03-15 19:07:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2092. [2022-03-15 19:07:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 2091 states have (on average 3.839789574366332) internal successors, (8029), 2091 states have internal predecessors, (8029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 8029 transitions. [2022-03-15 19:07:24,105 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 8029 transitions. Word has length 24 [2022-03-15 19:07:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:24,105 INFO L470 AbstractCegarLoop]: Abstraction has 2092 states and 8029 transitions. [2022-03-15 19:07:24,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 8029 transitions. [2022-03-15 19:07:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:07:24,109 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:24,109 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:24,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:24,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:24,323 INFO L402 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:24,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:24,324 INFO L85 PathProgramCache]: Analyzing trace with hash 128080025, now seen corresponding path program 123 times [2022-03-15 19:07:24,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:24,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403885860] [2022-03-15 19:07:24,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:24,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:24,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:24,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403885860] [2022-03-15 19:07:24,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403885860] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:24,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465639973] [2022-03-15 19:07:24,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:07:24,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:24,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:24,587 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:24,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2022-03-15 19:07:24,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:07:24,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:24,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:07:24,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:25,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:25,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465639973] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:25,878 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:25,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 19:07:25,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [445280203] [2022-03-15 19:07:25,878 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:25,880 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:25,889 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 126 transitions. [2022-03-15 19:07:25,889 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:27,864 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [816032#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (<= 5 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 5) (= (mod ~g3~0 256) 0))), 816033#(and (or (<= ~pos~0 4) (= (mod ~g3~0 256) 0)) (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 816031#(and (= ~d2~0 1) (= (mod ~d1~0 256) 0) (= ~g2~0 1) (or (= ~g3~0 0) (<= 3 ~pos~0)) (or (not (= (* (div ~d3~0 256) 256) ~d3~0)) (not (= ~g3~0 0))) (or (<= ~pos~0 3) (= ~g3~0 0)) (or (= ~g3~0 1) (= ~g3~0 0))), 816030#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 816036#(and (or (= ~g2~0 0) (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0)) (not (= ~g2~0 0)))), 816035#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 816029#(and (or (= ~g2~0 0) (<= ~pos~0 3)) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (= ~g2~0 0)) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0))) (or (= ~g2~0 1) (= ~g2~0 0)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (= ~g2~0 0))), 816034#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0))] [2022-03-15 19:07:27,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:07:27,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:27,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:07:27,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1359, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:07:27,865 INFO L87 Difference]: Start difference. First operand 2092 states and 8029 transitions. Second operand has 21 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:29,754 INFO L93 Difference]: Finished difference Result 2937 states and 10974 transitions. [2022-03-15 19:07:29,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 19:07:29,754 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:07:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:29,760 INFO L225 Difference]: With dead ends: 2937 [2022-03-15 19:07:29,760 INFO L226 Difference]: Without dead ends: 2930 [2022-03-15 19:07:29,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 48 SyntacticMatches, 13 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=653, Invalid=4039, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 19:07:29,760 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 228 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:29,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 0 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:07:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2022-03-15 19:07:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2258. [2022-03-15 19:07:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2257 states have (on average 3.862206468763846) internal successors, (8717), 2257 states have internal predecessors, (8717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 8717 transitions. [2022-03-15 19:07:29,796 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 8717 transitions. Word has length 24 [2022-03-15 19:07:29,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:29,796 INFO L470 AbstractCegarLoop]: Abstraction has 2258 states and 8717 transitions. [2022-03-15 19:07:29,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 8717 transitions. [2022-03-15 19:07:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:07:29,799 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:29,800 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:29,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:30,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2022-03-15 19:07:30,017 INFO L402 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash -845813963, now seen corresponding path program 124 times [2022-03-15 19:07:30,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:30,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801172937] [2022-03-15 19:07:30,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:30,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:30,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:30,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801172937] [2022-03-15 19:07:30,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801172937] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:30,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335904196] [2022-03-15 19:07:30,471 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:07:30,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:30,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:30,473 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:30,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-03-15 19:07:30,659 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:07:30,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:30,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:07:30,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:31,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:32,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335904196] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:32,026 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:32,026 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-03-15 19:07:32,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1642122114] [2022-03-15 19:07:32,027 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:32,028 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:32,037 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 116 transitions. [2022-03-15 19:07:32,037 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:34,144 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [823719#(and (or (not (= (mod ~g2~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g2~0 256) 0)) (< 0 (+ ~pos~0 1)))), 823723#(and (or (= ~g2~0 1) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0)) (<= ~d1~0 (* 256 (div ~d1~0 256)))) (or (= ~g2~0 1) (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0)) (<= 1 ~d1~0)) (or (= ~g2~0 1) (<= 0 (+ ~pos~0 1)) (not (= (mod ~g3~0 256) 0))) (or (<= (div ~d1~0 256) 0) (= ~g2~0 1) (<= 1 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (< 0 (+ (div ~d1~0 256) 1)) (not (= (mod ~g3~0 256) 0)))), 823718#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 823720#(and (or (not (= (mod ~g2~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1))) (or (not (= (mod ~g2~0 256) 0)) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0))), 823722#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 2))) (or (<= ~pos~0 1) (not (= (mod ~g3~0 256) 0)))), 823725#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g3~0 256) 0))), 823721#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 823726#(and (or (= 0 (mod ~d3~0 256)) (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (= 0 (mod ~d3~0 256)) (<= 0 ~pos~0) (= (mod ~g3~0 256) 0))), 823717#(and (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0)) (<= ~pos~0 1) (or (= (mod ~d1~0 256) 0) (<= (+ ~pos~0 1) 0)) (< 0 (+ ~pos~0 2))), 823724#(and (or (not (= (mod ~d1~0 256) 0)) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (<= 3 ~pos~0)) (or (= ~d2~0 1) (not (= (* (div ~d3~0 256) 256) ~d3~0))) (= ~g2~0 1) (or (= (mod ~d1~0 256) 0) (<= ~pos~0 1) (not (= (* (div ~d3~0 256) 256) ~d3~0))) (or (not (= (* (div ~d3~0 256) 256) ~d3~0)) (not (= ~g3~0 0))) (or (not (= (* (div ~d3~0 256) 256) ~d3~0)) (<= ~pos~0 3)) (or (<= 1 ~pos~0) (not (= (* (div ~d3~0 256) 256) ~d3~0))) (or (= ~g3~0 1) (= ~g3~0 0))), 823727#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0))] [2022-03-15 19:07:34,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:07:34,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:34,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:07:34,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1591, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:07:34,145 INFO L87 Difference]: Start difference. First operand 2258 states and 8717 transitions. Second operand has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:38,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:38,426 INFO L93 Difference]: Finished difference Result 4043 states and 14405 transitions. [2022-03-15 19:07:38,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 19:07:38,426 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:07:38,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:38,435 INFO L225 Difference]: With dead ends: 4043 [2022-03-15 19:07:38,435 INFO L226 Difference]: Without dead ends: 4022 [2022-03-15 19:07:38,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 45 SyntacticMatches, 9 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1852 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1274, Invalid=6382, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 19:07:38,436 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 571 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:38,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [571 Valid, 0 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:07:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2022-03-15 19:07:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 2284. [2022-03-15 19:07:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 2283 states have (on average 3.866841874726237) internal successors, (8828), 2283 states have internal predecessors, (8828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 8828 transitions. [2022-03-15 19:07:38,479 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 8828 transitions. Word has length 24 [2022-03-15 19:07:38,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:38,479 INFO L470 AbstractCegarLoop]: Abstraction has 2284 states and 8828 transitions. [2022-03-15 19:07:38,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:38,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 8828 transitions. [2022-03-15 19:07:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:07:38,483 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:38,484 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:38,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:38,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2022-03-15 19:07:38,695 INFO L402 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:38,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1987453105, now seen corresponding path program 125 times [2022-03-15 19:07:38,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:38,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766288748] [2022-03-15 19:07:38,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:38,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:39,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:39,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766288748] [2022-03-15 19:07:39,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766288748] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:39,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12632541] [2022-03-15 19:07:39,040 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:07:39,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:39,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:39,041 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:39,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-03-15 19:07:39,241 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:07:39,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:39,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:07:39,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:39,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:40,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12632541] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:40,889 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:40,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2022-03-15 19:07:40,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [100040104] [2022-03-15 19:07:40,889 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:40,891 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:40,900 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 116 transitions. [2022-03-15 19:07:40,900 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:43,034 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [832600#(and (or (not (= (mod ~g1~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g1~0 256) 0)) (< 0 (+ ~pos~0 1)))), 832607#(and (or (= 0 (mod ~d3~0 256)) (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (<= (+ ~pos~0 1) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (< 2 ~pos~0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (< 0 (+ ~pos~0 2))) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 3) (= (mod ~g1~0 256) 0))), 832541#(or (not (<= (mod ~g2~0 256) 0)) (and (<= ~pos~0 0) (< 0 (+ ~pos~0 1)))), 832606#(and (or (= (mod ~d1~0 256) 0) (= ~g2~0 1) (= (mod ~g1~0 256) 0) (<= (+ ~pos~0 1) 0) (= ~g1~0 1)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0) (= ~g1~0 1) (< 0 (+ ~pos~0 2))) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (< 0 ~pos~0) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= ~pos~0 1) (= (mod ~g1~0 256) 0))), 832605#(and (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 2 ~pos~0) (= (mod ~g1~0 256) 0)) (or (<= ~pos~0 2) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= ~d3~0 1) (= (mod ~g1~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0))), 832604#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= ~pos~0 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~d1~0 256) 0) (= (mod ~g1~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0))), 832601#(and (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 ~pos~0) (= (mod ~g1~0 256) 0))), 832602#(and (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g1~0 256) 0) (<= 3 ~pos~0)) (or (= (mod ~g1~0 256) 0) (= (* (div ~d3~0 256) 256) ~d3~0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 3) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0))), 832603#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= 1 ~pos~0) (= (mod ~g1~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (<= ~pos~0 1) (= (mod ~g1~0 256) 0)) (or (= (mod ~g1~0 256) 0) (= ~g1~0 1)) (or (= ~d2~0 1) (= (mod ~g1~0 256) 0)))] [2022-03-15 19:07:43,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:07:43,035 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:43,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:07:43,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1497, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:07:43,035 INFO L87 Difference]: Start difference. First operand 2284 states and 8828 transitions. Second operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:46,345 INFO L93 Difference]: Finished difference Result 3573 states and 13238 transitions. [2022-03-15 19:07:46,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 19:07:46,346 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:07:46,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:46,354 INFO L225 Difference]: With dead ends: 3573 [2022-03-15 19:07:46,354 INFO L226 Difference]: Without dead ends: 3560 [2022-03-15 19:07:46,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 40 SyntacticMatches, 15 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2777 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1467, Invalid=7653, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 19:07:46,355 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 384 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:46,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 0 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:07:46,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2022-03-15 19:07:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 2452. [2022-03-15 19:07:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 2451 states have (on average 3.876784985720114) internal successors, (9502), 2451 states have internal predecessors, (9502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 9502 transitions. [2022-03-15 19:07:46,395 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 9502 transitions. Word has length 24 [2022-03-15 19:07:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:46,395 INFO L470 AbstractCegarLoop]: Abstraction has 2452 states and 9502 transitions. [2022-03-15 19:07:46,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 9502 transitions. [2022-03-15 19:07:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:07:46,399 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:46,399 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:46,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:46,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable127 [2022-03-15 19:07:46,613 INFO L402 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:46,613 INFO L85 PathProgramCache]: Analyzing trace with hash 939657821, now seen corresponding path program 126 times [2022-03-15 19:07:46,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:46,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395436318] [2022-03-15 19:07:46,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:46,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:46,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:46,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395436318] [2022-03-15 19:07:46,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395436318] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:46,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000954075] [2022-03-15 19:07:46,924 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:07:46,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:46,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:46,925 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:46,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-03-15 19:07:47,128 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:07:47,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:47,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:07:47,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:47,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:48,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000954075] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:48,496 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:48,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 30 [2022-03-15 19:07:48,497 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [592109962] [2022-03-15 19:07:48,497 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:48,498 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:48,507 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 130 transitions. [2022-03-15 19:07:48,508 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:50,563 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [841362#(and (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (= ~g2~0 1) (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 841366#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0))), 841363#(and (or (= ~g2~0 0) (<= ~pos~0 2) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 0) (<= 2 ~pos~0) (not (= (mod ~g3~0 256) 0))) (or (= ~g2~0 1) (= ~g2~0 0) (not (= (mod ~g3~0 256) 0))) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= (mod ~g3~0 256) 0)) (not (= ~g2~0 0)))), 841365#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g3~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0))), 841367#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (= ~g3~0 1) (<= 0 ~pos~0)), 841361#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 841364#(and (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (= (mod ~g3~0 256) 0) (<= 4 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (<= ~pos~0 4) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:07:50,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:07:50,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:50,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:07:50,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1237, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:07:50,564 INFO L87 Difference]: Start difference. First operand 2452 states and 9502 transitions. Second operand has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:52,192 INFO L93 Difference]: Finished difference Result 3035 states and 11392 transitions. [2022-03-15 19:07:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:07:52,192 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:07:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:52,198 INFO L225 Difference]: With dead ends: 3035 [2022-03-15 19:07:52,198 INFO L226 Difference]: Without dead ends: 3028 [2022-03-15 19:07:52,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 51 SyntacticMatches, 14 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=566, Invalid=3216, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:07:52,199 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 232 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:52,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 0 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:07:52,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2022-03-15 19:07:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 2456. [2022-03-15 19:07:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2456 states, 2455 states have (on average 3.8769857433808554) internal successors, (9518), 2455 states have internal predecessors, (9518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:52,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 9518 transitions. [2022-03-15 19:07:52,236 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 9518 transitions. Word has length 24 [2022-03-15 19:07:52,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:52,236 INFO L470 AbstractCegarLoop]: Abstraction has 2456 states and 9518 transitions. [2022-03-15 19:07:52,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 9518 transitions. [2022-03-15 19:07:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:07:52,240 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:52,240 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:52,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:52,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2022-03-15 19:07:52,458 INFO L402 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:52,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:52,458 INFO L85 PathProgramCache]: Analyzing trace with hash 94686369, now seen corresponding path program 127 times [2022-03-15 19:07:52,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:52,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290852308] [2022-03-15 19:07:52,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:52,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:52,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:52,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290852308] [2022-03-15 19:07:52,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290852308] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:52,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887625283] [2022-03-15 19:07:52,786 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:07:52,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:52,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:52,792 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:52,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-03-15 19:07:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:52,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:07:52,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:53,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:54,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887625283] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:54,561 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:54,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2022-03-15 19:07:54,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [630119085] [2022-03-15 19:07:54,561 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:54,562 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:54,572 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 139 transitions. [2022-03-15 19:07:54,572 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:57,094 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [849531#(and (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (= ~g2~0 1) (<= ~pos~0 1) (<= 1 ~pos~0) (< 0 (+ (div ~d1~0 256) 1)) (<= ~d1~0 (* 256 (div ~d1~0 256)))), 849532#(and (= ~d2~0 1) (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 849534#(and (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (<= 4 ~pos~0)) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0))) (or (= ~g2~0 1) (= ~g2~0 0)) (or (= 0 (mod ~d3~0 256)) (= ~g2~0 0) (<= ~pos~0 0)) (or (= ~g2~0 0) (<= 0 ~pos~0)) (or (= ~g2~0 0) (<= ~pos~0 4))), 849533#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (<= 0 ~pos~0))] [2022-03-15 19:07:57,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:07:57,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:57,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:07:57,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1004, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:07:57,095 INFO L87 Difference]: Start difference. First operand 2456 states and 9518 transitions. Second operand has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:57,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:57,553 INFO L93 Difference]: Finished difference Result 2671 states and 10264 transitions. [2022-03-15 19:07:57,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:07:57,554 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:07:57,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:57,559 INFO L225 Difference]: With dead ends: 2671 [2022-03-15 19:07:57,559 INFO L226 Difference]: Without dead ends: 2664 [2022-03-15 19:07:57,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 42 SyntacticMatches, 29 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=296, Invalid=1264, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:07:57,559 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:57,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:07:57,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2022-03-15 19:07:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2454. [2022-03-15 19:07:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2454 states, 2453 states have (on average 3.878108438646555) internal successors, (9513), 2453 states have internal predecessors, (9513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2454 states and 9513 transitions. [2022-03-15 19:07:57,594 INFO L78 Accepts]: Start accepts. Automaton has 2454 states and 9513 transitions. Word has length 24 [2022-03-15 19:07:57,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:57,594 INFO L470 AbstractCegarLoop]: Abstraction has 2454 states and 9513 transitions. [2022-03-15 19:07:57,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 9513 transitions. [2022-03-15 19:07:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:07:57,598 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:57,598 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:57,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:57,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:57,805 INFO L402 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:57,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:57,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1263732127, now seen corresponding path program 128 times [2022-03-15 19:07:57,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:57,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116244947] [2022-03-15 19:07:57,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:57,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:58,062 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:58,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116244947] [2022-03-15 19:07:58,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116244947] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:58,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911986555] [2022-03-15 19:07:58,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:07:58,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:58,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:58,063 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:58,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2022-03-15 19:07:58,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:07:58,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:58,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:07:58,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:58,672 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:58,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:59,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911986555] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:59,542 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:59,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2022-03-15 19:07:59,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1071286116] [2022-03-15 19:07:59,542 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:59,543 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:59,554 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 143 transitions. [2022-03-15 19:07:59,554 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:02,465 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [857292#(and (or (not (= (mod ~g3~0 256) 0)) (<= ~pos~0 0)) (or (not (= (mod ~g3~0 256) 0)) (< 0 (+ ~pos~0 1)))), 857295#(and (= ~d2~0 1) (not (= (mod ~d1~0 256) 0)) (= ~g2~0 1) (= ~d3~0 1) (<= ~pos~0 0) (<= 0 ~pos~0)), 857297#(and (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0) (< 1 ~pos~0)) (or (not (= 0 (mod ~d3~0 256))) (<= ~pos~0 2) (= (mod ~g3~0 256) 0))), 857293#(and (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~d1~0 (* 256 (div ~d1~0 256))) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 1) (= (mod ~g3~0 256) 0)) (or (< 0 (+ (div ~d1~0 256) 1)) (= (mod ~g3~0 256) 0))), 857294#(and (or (<= 0 ~pos~0) (= (mod ~g3~0 256) 0)) (or (= ~d2~0 1) (= (mod ~g3~0 256) 0)) (or (<= ~pos~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= (mod ~g3~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= (mod ~g3~0 256) 0))), 857296#(and (or (= ~g2~0 0) (<= 2 ~pos~0) (= (mod ~g3~0 256) 0)) (or (not (= (* (div ~d2~0 256) 256) ~d2~0)) (not (= ~g2~0 0)) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 0) (<= ~pos~0 2) (= (mod ~g3~0 256) 0)) (or (not (= 0 (mod ~d3~0 256))) (= ~g2~0 0) (= (mod ~g3~0 256) 0)) (or (= ~g2~0 1) (= ~g2~0 0) (= (mod ~g3~0 256) 0)))] [2022-03-15 19:08:02,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:08:02,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:02,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:08:02,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1130, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:08:02,465 INFO L87 Difference]: Start difference. First operand 2454 states and 9513 transitions. Second operand has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:03,685 INFO L93 Difference]: Finished difference Result 2947 states and 11239 transitions. [2022-03-15 19:08:03,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:08:03,685 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:08:03,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:03,691 INFO L225 Difference]: With dead ends: 2947 [2022-03-15 19:08:03,691 INFO L226 Difference]: Without dead ends: 2940 [2022-03-15 19:08:03,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 48 SyntacticMatches, 23 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=680, Invalid=2860, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:08:03,692 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:03,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:08:03,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2022-03-15 19:08:03,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2482. [2022-03-15 19:08:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2482 states, 2481 states have (on average 3.8843208383716243) internal successors, (9637), 2481 states have internal predecessors, (9637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 9637 transitions. [2022-03-15 19:08:03,727 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 9637 transitions. Word has length 24 [2022-03-15 19:08:03,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:03,727 INFO L470 AbstractCegarLoop]: Abstraction has 2482 states and 9637 transitions. [2022-03-15 19:08:03,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:03,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 9637 transitions. [2022-03-15 19:08:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:08:03,731 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:03,731 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:03,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Forceful destruction successful, exit code 0 [2022-03-15 19:08:03,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:03,939 INFO L402 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:08:03,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:03,940 INFO L85 PathProgramCache]: Analyzing trace with hash 80022397, now seen corresponding path program 129 times [2022-03-15 19:08:03,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:03,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480525104] [2022-03-15 19:08:03,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:03,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:04,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:04,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480525104] [2022-03-15 19:08:04,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480525104] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:04,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004580897] [2022-03-15 19:08:04,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:08:04,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:04,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:04,270 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:04,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2022-03-15 19:08:04,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:08:04,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:08:04,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:08:04,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:04,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:05,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004580897] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:05,832 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:05,832 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 19:08:05,832 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [896110008] [2022-03-15 19:08:05,832 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:05,833 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:05,843 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 126 transitions. [2022-03-15 19:08:05,843 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider Received shutdown request... [2022-03-15 19:08:06,853 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 19:08:06,861 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:08:06,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Forceful destruction successful, exit code 0 [2022-03-15 19:08:06,878 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:08:07,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable131 [2022-03-15 19:08:07,053 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 4,while PredicateComparison was comparing new predicate (quantifier-free) to 35 known predicates. [2022-03-15 19:08:07,055 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 19:08:07,055 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 19:08:07,055 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 19:08:07,056 INFO L732 BasicCegarLoop]: Path program histogram: [129, 1, 1, 1] [2022-03-15 19:08:07,057 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:08:07,058 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:08:07,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:08:07 BasicIcfg [2022-03-15 19:08:07,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:08:07,059 INFO L158 Benchmark]: Toolchain (without parser) took 856271.76ms. Allocated memory was 178.3MB in the beginning and 979.4MB in the end (delta: 801.1MB). Free memory was 124.7MB in the beginning and 837.5MB in the end (delta: -712.9MB). Peak memory consumption was 89.4MB. Max. memory is 8.0GB. [2022-03-15 19:08:07,059 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:08:07,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.10ms. Allocated memory is still 178.3MB. Free memory was 124.5MB in the beginning and 149.8MB in the end (delta: -25.3MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-03-15 19:08:07,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.94ms. Allocated memory is still 178.3MB. Free memory was 149.8MB in the beginning and 148.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:08:07,059 INFO L158 Benchmark]: Boogie Preprocessor took 28.65ms. Allocated memory is still 178.3MB. Free memory was 148.2MB in the beginning and 147.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:08:07,059 INFO L158 Benchmark]: RCFGBuilder took 386.64ms. Allocated memory is still 178.3MB. Free memory was 146.6MB in the beginning and 132.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-03-15 19:08:07,059 INFO L158 Benchmark]: TraceAbstraction took 855588.61ms. Allocated memory was 178.3MB in the beginning and 979.4MB in the end (delta: 801.1MB). Free memory was 132.0MB in the beginning and 837.5MB in the end (delta: -705.6MB). Peak memory consumption was 96.8MB. Max. memory is 8.0GB. [2022-03-15 19:08:07,060 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.10ms. Allocated memory is still 178.3MB. Free memory was 124.5MB in the beginning and 149.8MB in the end (delta: -25.3MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.94ms. Allocated memory is still 178.3MB. Free memory was 149.8MB in the beginning and 148.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.65ms. Allocated memory is still 178.3MB. Free memory was 148.2MB in the beginning and 147.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 386.64ms. Allocated memory is still 178.3MB. Free memory was 146.6MB in the beginning and 132.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 855588.61ms. Allocated memory was 178.3MB in the beginning and 979.4MB in the end (delta: 801.1MB). Free memory was 132.0MB in the beginning and 837.5MB in the end (delta: -705.6MB). Peak memory consumption was 96.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 123 PlacesBefore, 30 PlacesAfterwards, 129 TransitionsBefore, 23 TransitionsAfterwards, 2958 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 11 ConcurrentYvCompositions, 13 ChoiceCompositions, 125 TotalNumberOfCompositions, 3060 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2792, positive: 2781, positive conditional: 0, positive unconditional: 2781, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1558, positive: 1549, positive conditional: 0, positive unconditional: 1549, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2792, positive: 1232, positive conditional: 0, positive unconditional: 1232, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 1558, unknown conditional: 0, unknown unconditional: 1558] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 4,while PredicateComparison was comparing new predicate (quantifier-free) to 35 known predicates. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 4,while PredicateComparison was comparing new predicate (quantifier-free) to 35 known predicates. - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 4,while PredicateComparison was comparing new predicate (quantifier-free) to 35 known predicates. - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 4,while PredicateComparison was comparing new predicate (quantifier-free) to 35 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 855.5s, OverallIterations: 132, TraceHistogramMax: 4, PathProgramHistogramMax: 129, EmptinessCheckTime: 0.4s, AutomataDifference: 271.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36198 SdHoareTripleChecker+Valid, 61.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36198 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 52.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59698 mSDsCounter, 16325 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105533 IncrementalHoareTripleChecker+Invalid, 121858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16325 mSolverCounterUnsat, 0 mSDtfsCounter, 105533 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16804 GetRequests, 6661 SyntacticMatches, 2431 SemanticMatches, 7712 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213833 ImplicationChecksByTransitivity, 300.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2634occurred in iteration=100, InterpolantAutomatonStates: 4951, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 131 MinimizatonAttempts, 106419 StatesRemovedByMinimization, 125 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 180.8s InterpolantComputationTime, 5923 NumberOfCodeBlocks, 5923 NumberOfCodeBlocksAsserted, 458 NumberOfCheckSat, 8472 ConstructedInterpolants, 0 QuantifiedInterpolants, 188379 SizeOfPredicates, 1871 NumberOfNonLiveVariables, 21566 ConjunctsInSsa, 2990 ConjunctsInUnsatCore, 387 InterpolantComputations, 3 PerfectInterpolantSequences, 136/4743 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown