./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/xor5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-crafted/xor5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 21:28:51,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 21:28:51,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 21:28:51,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 21:28:51,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 21:28:51,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 21:28:51,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 21:28:51,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 21:28:51,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 21:28:51,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 21:28:51,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 21:28:51,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 21:28:51,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 21:28:51,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 21:28:51,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 21:28:51,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 21:28:51,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 21:28:51,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 21:28:51,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 21:28:51,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 21:28:51,196 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 21:28:51,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 21:28:51,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 21:28:51,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 21:28:51,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 21:28:51,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 21:28:51,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 21:28:51,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 21:28:51,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 21:28:51,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 21:28:51,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 21:28:51,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 21:28:51,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 21:28:51,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 21:28:51,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 21:28:51,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 21:28:51,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 21:28:51,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 21:28:51,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 21:28:51,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 21:28:51,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 21:28:51,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 21:28:51,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 21:28:51,231 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 21:28:51,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 21:28:51,231 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 21:28:51,231 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 21:28:51,232 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 21:28:51,232 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 21:28:51,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 21:28:51,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 21:28:51,233 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 21:28:51,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 21:28:51,233 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 21:28:51,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 21:28:51,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 21:28:51,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 21:28:51,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 21:28:51,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 21:28:51,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 21:28:51,235 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 21:28:51,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 21:28:51,235 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 21:28:51,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 21:28:51,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 21:28:51,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 21:28:51,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 21:28:51,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:28:51,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 21:28:51,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 21:28:51,236 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 21:28:51,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 21:28:51,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 21:28:51,237 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 21:28:51,237 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 21:28:51,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 21:28:51,237 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 [2022-07-20 21:28:51,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 21:28:51,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 21:28:51,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 21:28:51,407 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 21:28:51,408 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 21:28:51,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor5.i [2022-07-20 21:28:51,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff58a365b/0ff31bb6718f417780a990ced77cf3a2/FLAGeb7cc9fdd [2022-07-20 21:28:51,825 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 21:28:51,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i [2022-07-20 21:28:51,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff58a365b/0ff31bb6718f417780a990ced77cf3a2/FLAGeb7cc9fdd [2022-07-20 21:28:52,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff58a365b/0ff31bb6718f417780a990ced77cf3a2 [2022-07-20 21:28:52,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 21:28:52,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 21:28:52,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 21:28:52,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 21:28:52,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 21:28:52,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:28:52" (1/1) ... [2022-07-20 21:28:52,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e65552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:52, skipping insertion in model container [2022-07-20 21:28:52,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:28:52" (1/1) ... [2022-07-20 21:28:52,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 21:28:52,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 21:28:52,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i[1364,1377] [2022-07-20 21:28:52,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:28:52,472 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 21:28:52,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i[1364,1377] [2022-07-20 21:28:52,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:28:52,515 INFO L208 MainTranslator]: Completed translation [2022-07-20 21:28:52,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:52 WrapperNode [2022-07-20 21:28:52,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 21:28:52,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 21:28:52,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 21:28:52,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 21:28:52,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:52" (1/1) ... [2022-07-20 21:28:52,537 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:52" (1/1) ... [2022-07-20 21:28:52,558 INFO L137 Inliner]: procedures = 16, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2022-07-20 21:28:52,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 21:28:52,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 21:28:52,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 21:28:52,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 21:28:52,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:52" (1/1) ... [2022-07-20 21:28:52,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:52" (1/1) ... [2022-07-20 21:28:52,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:52" (1/1) ... [2022-07-20 21:28:52,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:52" (1/1) ... [2022-07-20 21:28:52,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:52" (1/1) ... [2022-07-20 21:28:52,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:52" (1/1) ... [2022-07-20 21:28:52,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:52" (1/1) ... [2022-07-20 21:28:52,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 21:28:52,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 21:28:52,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 21:28:52,602 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 21:28:52,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:52" (1/1) ... [2022-07-20 21:28:52,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:28:52,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:28:52,638 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-07-20 21:28:52,651 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-07-20 21:28:52,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 21:28:52,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 21:28:52,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 21:28:52,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 21:28:52,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 21:28:52,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 21:28:52,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 21:28:52,681 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2022-07-20 21:28:52,682 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2022-07-20 21:28:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 21:28:52,743 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 21:28:52,752 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 21:28:52,853 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 21:28:52,857 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 21:28:52,857 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 21:28:52,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:28:52 BoogieIcfgContainer [2022-07-20 21:28:52,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 21:28:52,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 21:28:52,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 21:28:52,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 21:28:52,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 09:28:52" (1/3) ... [2022-07-20 21:28:52,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27844912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:28:52, skipping insertion in model container [2022-07-20 21:28:52,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:52" (2/3) ... [2022-07-20 21:28:52,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27844912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:28:52, skipping insertion in model container [2022-07-20 21:28:52,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:28:52" (3/3) ... [2022-07-20 21:28:52,869 INFO L111 eAbstractionObserver]: Analyzing ICFG xor5.i [2022-07-20 21:28:52,879 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 21:28:52,879 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 21:28:52,912 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 21:28:52,917 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f8d19ae, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@35cca6c [2022-07-20 21:28:52,918 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 21:28:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:28:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 21:28:52,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:28:52,927 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:28:52,928 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:28:52,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:28:52,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2030793856, now seen corresponding path program 1 times [2022-07-20 21:28:52,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:28:52,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067164700] [2022-07-20 21:28:52,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:28:52,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:28:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:53,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-20 21:28:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:53,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 21:28:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:53,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 21:28:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 21:28:53,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:28:53,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067164700] [2022-07-20 21:28:53,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067164700] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:28:53,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:28:53,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 21:28:53,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465265575] [2022-07-20 21:28:53,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:28:53,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 21:28:53,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:28:53,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 21:28:53,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:28:53,098 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 21:28:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:28:53,113 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-07-20 21:28:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 21:28:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-20 21:28:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:28:53,120 INFO L225 Difference]: With dead ends: 51 [2022-07-20 21:28:53,120 INFO L226 Difference]: Without dead ends: 23 [2022-07-20 21:28:53,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:28:53,126 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:28:53,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:28:53,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-20 21:28:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-20 21:28:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:28:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-20 21:28:53,153 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2022-07-20 21:28:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:28:53,154 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-20 21:28:53,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 21:28:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-20 21:28:53,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 21:28:53,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:28:53,156 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:28:53,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 21:28:53,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:28:53,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:28:53,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1398988038, now seen corresponding path program 1 times [2022-07-20 21:28:53,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:28:53,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079090335] [2022-07-20 21:28:53,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:28:53,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:28:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:53,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-20 21:28:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:53,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 21:28:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:53,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 21:28:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 21:28:53,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:28:53,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079090335] [2022-07-20 21:28:53,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079090335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:28:53,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:28:53,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 21:28:53,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378647976] [2022-07-20 21:28:53,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:28:53,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 21:28:53,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:28:53,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 21:28:53,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 21:28:53,258 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 21:28:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:28:53,303 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-07-20 21:28:53,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 21:28:53,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-20 21:28:53,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:28:53,307 INFO L225 Difference]: With dead ends: 43 [2022-07-20 21:28:53,307 INFO L226 Difference]: Without dead ends: 25 [2022-07-20 21:28:53,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 21:28:53,309 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:28:53,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:28:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-20 21:28:53,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-07-20 21:28:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:28:53,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-20 21:28:53,315 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2022-07-20 21:28:53,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:28:53,316 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-20 21:28:53,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 21:28:53,316 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-20 21:28:53,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 21:28:53,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:28:53,317 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:28:53,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 21:28:53,318 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:28:53,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:28:53,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1708163684, now seen corresponding path program 1 times [2022-07-20 21:28:53,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:28:53,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762329853] [2022-07-20 21:28:53,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:28:53,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:28:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:53,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 21:28:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:53,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-20 21:28:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:53,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 21:28:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 21:28:53,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:28:53,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762329853] [2022-07-20 21:28:53,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762329853] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:28:53,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108526267] [2022-07-20 21:28:53,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:28:53,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:28:53,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:28:53,412 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-07-20 21:28:53,413 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-07-20 21:28:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:53,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 21:28:53,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:28:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 21:28:53,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:28:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 21:28:53,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108526267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:28:53,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:28:53,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-07-20 21:28:53,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551580308] [2022-07-20 21:28:53,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:28:53,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 21:28:53,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:28:53,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 21:28:53,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-20 21:28:53,586 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 21:28:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:28:53,663 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-07-20 21:28:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 21:28:53,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 31 [2022-07-20 21:28:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:28:53,665 INFO L225 Difference]: With dead ends: 47 [2022-07-20 21:28:53,665 INFO L226 Difference]: Without dead ends: 29 [2022-07-20 21:28:53,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-20 21:28:53,666 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:28:53,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:28:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-20 21:28:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-20 21:28:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:28:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-20 21:28:53,672 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 31 [2022-07-20 21:28:53,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:28:53,672 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-20 21:28:53,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 21:28:53,672 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-20 21:28:53,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 21:28:53,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:28:53,674 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:28:53,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-20 21:28:53,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:28:53,887 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:28:53,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:28:53,888 INFO L85 PathProgramCache]: Analyzing trace with hash 533240604, now seen corresponding path program 1 times [2022-07-20 21:28:53,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:28:53,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358511779] [2022-07-20 21:28:53,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:28:53,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:28:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:53,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 21:28:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:53,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 21:28:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:54,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-20 21:28:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-20 21:28:54,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:28:54,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358511779] [2022-07-20 21:28:54,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358511779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:28:54,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462965232] [2022-07-20 21:28:54,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:28:54,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:28:54,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:28:54,027 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-07-20 21:28:54,063 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-07-20 21:28:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:54,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 21:28:54,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:28:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-20 21:28:54,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:28:54,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462965232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:28:54,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 21:28:54,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-20 21:28:54,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954319598] [2022-07-20 21:28:54,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:28:54,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 21:28:54,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:28:54,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 21:28:54,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 21:28:54,164 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 21:28:54,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:28:54,195 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-07-20 21:28:54,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 21:28:54,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-07-20 21:28:54,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:28:54,198 INFO L225 Difference]: With dead ends: 42 [2022-07-20 21:28:54,199 INFO L226 Difference]: Without dead ends: 29 [2022-07-20 21:28:54,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 21:28:54,203 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:28:54,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:28:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-20 21:28:54,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-07-20 21:28:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:28:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-20 21:28:54,214 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2022-07-20 21:28:54,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:28:54,215 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-20 21:28:54,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 21:28:54,215 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-20 21:28:54,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 21:28:54,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:28:54,216 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:28:54,234 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-07-20 21:28:54,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-20 21:28:54,435 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:28:54,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:28:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash 850880602, now seen corresponding path program 1 times [2022-07-20 21:28:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:28:54,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690688187] [2022-07-20 21:28:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:28:54,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:28:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 21:28:54,524 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 21:28:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 21:28:54,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 21:28:54,594 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 21:28:54,595 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-20 21:28:54,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 21:28:54,598 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-20 21:28:54,600 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 21:28:54,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 09:28:54 BoogieIcfgContainer [2022-07-20 21:28:54,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 21:28:54,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 21:28:54,627 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 21:28:54,627 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 21:28:54,628 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:28:52" (3/4) ... [2022-07-20 21:28:54,630 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 21:28:54,630 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 21:28:54,631 INFO L158 Benchmark]: Toolchain (without parser) took 2377.66ms. Allocated memory is still 138.4MB. Free memory was 108.1MB in the beginning and 57.6MB in the end (delta: 50.5MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2022-07-20 21:28:54,631 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 90.2MB. Free memory was 45.9MB in the beginning and 45.8MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 21:28:54,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.40ms. Allocated memory is still 138.4MB. Free memory was 107.7MB in the beginning and 113.9MB in the end (delta: -6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 21:28:54,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.14ms. Allocated memory is still 138.4MB. Free memory was 113.9MB in the beginning and 112.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 21:28:54,632 INFO L158 Benchmark]: Boogie Preprocessor took 41.06ms. Allocated memory is still 138.4MB. Free memory was 111.9MB in the beginning and 110.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 21:28:54,632 INFO L158 Benchmark]: RCFGBuilder took 257.90ms. Allocated memory is still 138.4MB. Free memory was 110.8MB in the beginning and 99.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-20 21:28:54,632 INFO L158 Benchmark]: TraceAbstraction took 1766.55ms. Allocated memory is still 138.4MB. Free memory was 98.8MB in the beginning and 57.6MB in the end (delta: 41.2MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2022-07-20 21:28:54,632 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 138.4MB. Free memory is still 57.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 21:28:54,633 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.19ms. Allocated memory is still 90.2MB. Free memory was 45.9MB in the beginning and 45.8MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.40ms. Allocated memory is still 138.4MB. Free memory was 107.7MB in the beginning and 113.9MB in the end (delta: -6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.14ms. Allocated memory is still 138.4MB. Free memory was 113.9MB in the beginning and 112.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.06ms. Allocated memory is still 138.4MB. Free memory was 111.9MB in the beginning and 110.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 257.90ms. Allocated memory is still 138.4MB. Free memory was 110.8MB in the beginning and 99.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1766.55ms. Allocated memory is still 138.4MB. Free memory was 98.8MB in the beginning and 57.6MB in the end (delta: 41.2MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 138.4MB. Free memory is still 57.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - UnprovableResult [Line: 57]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseXOr at line 25. Possible FailurePath: [L17] int N; VAL [N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; [L35] int temp; [L36] int ret; [L37] int ret2; [L38] int ret5; [L40] int i = 0; VAL [i=0, N=2, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=1, N=2, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=2, N=2, x={9:0}] [L40] COND FALSE !(i < N) VAL [i=2, N=2, x={9:0}] [L45] CALL, EXPR xor(x) VAL [N=2, x={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=-1, x={9:0}, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res ^ x[i] [L24] i++ VAL [i=2, N=2, res=0, x={9:0}, x={9:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, res=0, x={9:0}, x={9:0}] [L27] return res; VAL [\result=0, i=2, N=2, res=0, x={9:0}, x={9:0}] [L45] RET, EXPR xor(x) VAL [i=2, N=2, x={9:0}, xor(x)=0] [L45] ret = xor(x) [L47] EXPR x[0] [L47] temp=x[0] [L47] EXPR x[1] [L47] x[0] = x[1] [L47] x[1] = temp VAL [i=2, N=2, ret=0, temp=-1, x={9:0}] [L48] CALL, EXPR xor(x) VAL [N=2, x={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=1, x={9:0}, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res ^ x[i] [L24] i++ VAL [i=2, N=2, res=1, x={9:0}, x={9:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, res=1, x={9:0}, x={9:0}] [L27] return res; VAL [\result=1, i=2, N=2, res=1, x={9:0}, x={9:0}] [L48] RET, EXPR xor(x) VAL [i=2, N=2, ret=0, temp=-1, x={9:0}, xor(x)=1] [L48] ret2 = xor(x) [L49] EXPR x[0] [L49] temp=x[0] [L50] int i =0 ; VAL [i=0, i=2, N=2, ret=0, ret2=1, temp=1, x={9:0}] [L50] COND TRUE i main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 [2022-07-20 21:28:57,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 21:28:57,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 21:28:57,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 21:28:57,212 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 21:28:57,212 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 21:28:57,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor5.i [2022-07-20 21:28:57,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04aa5c0b8/c0db6a034a6f461790ceb032b0e8f0d0/FLAG26fbf94d8 [2022-07-20 21:28:57,620 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 21:28:57,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i [2022-07-20 21:28:57,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04aa5c0b8/c0db6a034a6f461790ceb032b0e8f0d0/FLAG26fbf94d8 [2022-07-20 21:28:58,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04aa5c0b8/c0db6a034a6f461790ceb032b0e8f0d0 [2022-07-20 21:28:58,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 21:28:58,022 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 21:28:58,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 21:28:58,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 21:28:58,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 21:28:58,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:28:58" (1/1) ... [2022-07-20 21:28:58,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae15303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:58, skipping insertion in model container [2022-07-20 21:28:58,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:28:58" (1/1) ... [2022-07-20 21:28:58,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 21:28:58,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 21:28:58,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i[1364,1377] [2022-07-20 21:28:58,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:28:58,249 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 21:28:58,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i[1364,1377] [2022-07-20 21:28:58,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:28:58,317 INFO L208 MainTranslator]: Completed translation [2022-07-20 21:28:58,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:58 WrapperNode [2022-07-20 21:28:58,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 21:28:58,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 21:28:58,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 21:28:58,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 21:28:58,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:58" (1/1) ... [2022-07-20 21:28:58,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:58" (1/1) ... [2022-07-20 21:28:58,354 INFO L137 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2022-07-20 21:28:58,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 21:28:58,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 21:28:58,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 21:28:58,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 21:28:58,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:58" (1/1) ... [2022-07-20 21:28:58,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:58" (1/1) ... [2022-07-20 21:28:58,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:58" (1/1) ... [2022-07-20 21:28:58,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:58" (1/1) ... [2022-07-20 21:28:58,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:58" (1/1) ... [2022-07-20 21:28:58,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:58" (1/1) ... [2022-07-20 21:28:58,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:58" (1/1) ... [2022-07-20 21:28:58,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 21:28:58,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 21:28:58,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 21:28:58,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 21:28:58,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:58" (1/1) ... [2022-07-20 21:28:58,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:28:58,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:28:58,433 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-07-20 21:28:58,451 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-07-20 21:28:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 21:28:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 21:28:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 21:28:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 21:28:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 21:28:58,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 21:28:58,478 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2022-07-20 21:28:58,478 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2022-07-20 21:28:58,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 21:28:58,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 21:28:58,546 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 21:28:58,548 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 21:28:58,681 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 21:28:58,685 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 21:28:58,685 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 21:28:58,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:28:58 BoogieIcfgContainer [2022-07-20 21:28:58,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 21:28:58,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 21:28:58,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 21:28:58,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 21:28:58,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 09:28:58" (1/3) ... [2022-07-20 21:28:58,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcfa971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:28:58, skipping insertion in model container [2022-07-20 21:28:58,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:28:58" (2/3) ... [2022-07-20 21:28:58,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcfa971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:28:58, skipping insertion in model container [2022-07-20 21:28:58,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:28:58" (3/3) ... [2022-07-20 21:28:58,699 INFO L111 eAbstractionObserver]: Analyzing ICFG xor5.i [2022-07-20 21:28:58,708 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 21:28:58,709 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 21:28:58,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 21:28:58,744 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5f3f0aef, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1f31ef12 [2022-07-20 21:28:58,744 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 21:28:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:28:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 21:28:58,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:28:58,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:28:58,754 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:28:58,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:28:58,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2030793856, now seen corresponding path program 1 times [2022-07-20 21:28:58,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:28:58,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371241873] [2022-07-20 21:28:58,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:28:58,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:28:58,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:28:58,779 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:28:58,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 21:28:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:58,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-20 21:28:58,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:28:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 21:28:58,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:28:58,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:28:58,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371241873] [2022-07-20 21:28:58,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371241873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:28:58,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:28:58,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 21:28:58,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982644313] [2022-07-20 21:28:58,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:28:58,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 21:28:58,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:28:58,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 21:28:58,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:28:58,938 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 21:28:58,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:28:58,952 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-07-20 21:28:58,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 21:28:58,953 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-20 21:28:58,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:28:58,957 INFO L225 Difference]: With dead ends: 51 [2022-07-20 21:28:58,957 INFO L226 Difference]: Without dead ends: 23 [2022-07-20 21:28:58,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:28:58,961 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:28:58,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:28:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-20 21:28:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-20 21:28:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:28:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-20 21:28:58,982 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2022-07-20 21:28:58,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:28:58,982 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-20 21:28:58,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 21:28:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-20 21:28:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 21:28:58,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:28:58,984 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:28:58,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 21:28:59,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:28:59,192 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:28:59,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:28:59,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1398988038, now seen corresponding path program 1 times [2022-07-20 21:28:59,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:28:59,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369754170] [2022-07-20 21:28:59,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:28:59,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:28:59,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:28:59,196 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:28:59,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 21:28:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:59,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 21:28:59,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:28:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 21:28:59,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:28:59,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:28:59,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369754170] [2022-07-20 21:28:59,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369754170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:28:59,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:28:59,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 21:28:59,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274870695] [2022-07-20 21:28:59,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:28:59,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 21:28:59,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:28:59,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 21:28:59,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 21:28:59,356 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 21:28:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:28:59,390 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-07-20 21:28:59,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 21:28:59,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-20 21:28:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:28:59,392 INFO L225 Difference]: With dead ends: 43 [2022-07-20 21:28:59,393 INFO L226 Difference]: Without dead ends: 25 [2022-07-20 21:28:59,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 21:28:59,395 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:28:59,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:28:59,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-20 21:28:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-07-20 21:28:59,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:28:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-20 21:28:59,405 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2022-07-20 21:28:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:28:59,405 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-20 21:28:59,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 21:28:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-20 21:28:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 21:28:59,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:28:59,407 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:28:59,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 21:28:59,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:28:59,614 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:28:59,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:28:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1708163684, now seen corresponding path program 1 times [2022-07-20 21:28:59,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:28:59,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537344440] [2022-07-20 21:28:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:28:59,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:28:59,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:28:59,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:28:59,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 21:28:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:28:59,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 21:28:59,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:28:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 21:28:59,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:28:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 21:28:59,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:28:59,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537344440] [2022-07-20 21:28:59,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537344440] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:28:59,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:28:59,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-20 21:28:59,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732716958] [2022-07-20 21:28:59,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:28:59,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 21:28:59,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:28:59,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 21:28:59,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 21:28:59,792 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-20 21:28:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:28:59,863 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-20 21:28:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:28:59,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 31 [2022-07-20 21:28:59,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:28:59,864 INFO L225 Difference]: With dead ends: 45 [2022-07-20 21:28:59,864 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 21:28:59,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 21:28:59,866 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:28:59,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:28:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 21:28:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-07-20 21:28:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:28:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-07-20 21:28:59,870 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 31 [2022-07-20 21:28:59,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:28:59,870 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-07-20 21:28:59,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-20 21:28:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-07-20 21:28:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 21:28:59,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:28:59,872 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:28:59,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 21:29:00,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:29:00,079 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:29:00,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:29:00,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1821751230, now seen corresponding path program 2 times [2022-07-20 21:29:00,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:29:00,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975552327] [2022-07-20 21:29:00,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:29:00,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:29:00,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:29:00,084 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:29:00,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 21:29:00,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 21:29:00,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:29:00,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 21:29:00,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:29:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 21:29:00,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 21:29:00,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:29:00,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975552327] [2022-07-20 21:29:00,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975552327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:29:00,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:29:00,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 21:29:00,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406989899] [2022-07-20 21:29:00,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:29:00,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 21:29:00,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:29:00,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 21:29:00,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 21:29:00,179 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 21:29:00,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:29:00,219 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-07-20 21:29:00,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 21:29:00,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-07-20 21:29:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:29:00,220 INFO L225 Difference]: With dead ends: 45 [2022-07-20 21:29:00,221 INFO L226 Difference]: Without dead ends: 28 [2022-07-20 21:29:00,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-07-20 21:29:00,222 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:29:00,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:29:00,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-20 21:29:00,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-20 21:29:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:29:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-20 21:29:00,226 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2022-07-20 21:29:00,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:29:00,226 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-20 21:29:00,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 21:29:00,227 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-20 21:29:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 21:29:00,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:29:00,228 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:29:00,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 21:29:00,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:29:00,435 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:29:00,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:29:00,436 INFO L85 PathProgramCache]: Analyzing trace with hash 533240604, now seen corresponding path program 1 times [2022-07-20 21:29:00,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:29:00,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340854780] [2022-07-20 21:29:00,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:29:00,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:29:00,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:29:00,438 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:29:00,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 21:29:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:29:00,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 21:29:00,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:29:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 21:29:00,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:29:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 21:29:00,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:29:00,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340854780] [2022-07-20 21:29:00,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340854780] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:29:00,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:29:00,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-20 21:29:00,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004399093] [2022-07-20 21:29:00,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:29:00,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 21:29:00,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:29:00,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 21:29:00,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-20 21:29:00,832 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 21:29:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:29:01,034 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-07-20 21:29:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 21:29:01,035 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-07-20 21:29:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:29:01,036 INFO L225 Difference]: With dead ends: 65 [2022-07-20 21:29:01,036 INFO L226 Difference]: Without dead ends: 52 [2022-07-20 21:29:01,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2022-07-20 21:29:01,037 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:29:01,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 62 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:29:01,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-20 21:29:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2022-07-20 21:29:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:29:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-20 21:29:01,043 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2022-07-20 21:29:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:29:01,044 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-20 21:29:01,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 21:29:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-20 21:29:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 21:29:01,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:29:01,045 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:29:01,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-20 21:29:01,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:29:01,253 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:29:01,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:29:01,253 INFO L85 PathProgramCache]: Analyzing trace with hash 850880602, now seen corresponding path program 1 times [2022-07-20 21:29:01,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:29:01,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038848543] [2022-07-20 21:29:01,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:29:01,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:29:01,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:29:01,255 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:29:01,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 21:29:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:29:01,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-20 21:29:01,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:29:01,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:01,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:29:01,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2022-07-20 21:29:01,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:01,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:29:01,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 36 [2022-07-20 21:29:02,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:02,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:29:02,089 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:29:02,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 48 [2022-07-20 21:29:02,310 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:29:02,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 25 [2022-07-20 21:29:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 21:29:02,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:29:08,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 87 [2022-07-20 21:29:08,394 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 21:29:08,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 88 [2022-07-20 21:29:16,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 87 [2022-07-20 21:29:16,166 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 21:29:16,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 1 [2022-07-20 21:29:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 14 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 21:29:16,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:29:16,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038848543] [2022-07-20 21:29:16,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038848543] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:29:16,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:29:16,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2022-07-20 21:29:16,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914204545] [2022-07-20 21:29:16,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:29:16,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-20 21:29:16,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:29:16,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-20 21:29:16,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1455, Unknown=2, NotChecked=0, Total=1640 [2022-07-20 21:29:16,569 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 21:29:18,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 21:29:24,305 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 21:29:28,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:29:28,091 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2022-07-20 21:29:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 21:29:28,091 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2022-07-20 21:29:28,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:29:28,095 INFO L225 Difference]: With dead ends: 84 [2022-07-20 21:29:28,095 INFO L226 Difference]: Without dead ends: 80 [2022-07-20 21:29:28,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=386, Invalid=2692, Unknown=2, NotChecked=0, Total=3080 [2022-07-20 21:29:28,097 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 88 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 102 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-20 21:29:28,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 194 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 758 Invalid, 1 Unknown, 46 Unchecked, 6.3s Time] [2022-07-20 21:29:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-20 21:29:28,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2022-07-20 21:29:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.183673469387755) internal successors, (58), 51 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-20 21:29:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2022-07-20 21:29:28,108 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 41 [2022-07-20 21:29:28,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:29:28,109 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-07-20 21:29:28,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 21:29:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2022-07-20 21:29:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 21:29:28,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:29:28,110 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:29:28,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-20 21:29:28,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:29:28,320 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:29:28,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:29:28,321 INFO L85 PathProgramCache]: Analyzing trace with hash 88846840, now seen corresponding path program 2 times [2022-07-20 21:29:28,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:29:28,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284092327] [2022-07-20 21:29:28,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:29:28,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:29:28,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:29:28,323 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:29:28,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 21:29:28,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 21:29:28,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:29:28,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 21:29:28,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:29:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-20 21:29:28,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:29:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-20 21:29:28,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:29:28,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284092327] [2022-07-20 21:29:28,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284092327] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:29:28,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:29:28,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2022-07-20 21:29:28,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512608955] [2022-07-20 21:29:28,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:29:28,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 21:29:28,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:29:28,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 21:29:28,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-20 21:29:28,851 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-20 21:29:29,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:29:29,299 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2022-07-20 21:29:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 21:29:29,300 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-07-20 21:29:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:29:29,303 INFO L225 Difference]: With dead ends: 104 [2022-07-20 21:29:29,303 INFO L226 Difference]: Without dead ends: 78 [2022-07-20 21:29:29,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-07-20 21:29:29,305 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 89 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 21:29:29,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 157 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 21:29:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-20 21:29:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2022-07-20 21:29:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 21:29:29,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-07-20 21:29:29,332 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 43 [2022-07-20 21:29:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:29:29,332 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-07-20 21:29:29,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-20 21:29:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-07-20 21:29:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 21:29:29,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:29:29,335 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:29:29,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 21:29:29,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:29:29,538 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:29:29,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:29:29,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1417469948, now seen corresponding path program 3 times [2022-07-20 21:29:29,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:29:29,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725113739] [2022-07-20 21:29:29,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 21:29:29,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:29:29,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:29:29,540 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:29:29,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 21:29:29,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 21:29:29,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:29:29,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 21:29:29,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:29:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-20 21:29:29,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:29:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-20 21:29:29,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:29:29,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725113739] [2022-07-20 21:29:29,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725113739] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:29:29,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:29:29,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2022-07-20 21:29:29,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55277502] [2022-07-20 21:29:29,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:29:29,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 21:29:29,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:29:29,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 21:29:29,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-20 21:29:29,937 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-20 21:29:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:29:30,174 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-07-20 21:29:30,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 21:29:30,175 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-07-20 21:29:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:29:30,176 INFO L225 Difference]: With dead ends: 77 [2022-07-20 21:29:30,176 INFO L226 Difference]: Without dead ends: 58 [2022-07-20 21:29:30,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-20 21:29:30,177 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 92 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 21:29:30,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 113 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 21:29:30,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-20 21:29:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-07-20 21:29:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 21:29:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-07-20 21:29:30,184 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2022-07-20 21:29:30,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:29:30,184 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-07-20 21:29:30,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-20 21:29:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-07-20 21:29:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 21:29:30,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:29:30,185 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:29:30,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-20 21:29:30,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:29:30,393 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:29:30,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:29:30,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2102516822, now seen corresponding path program 4 times [2022-07-20 21:29:30,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:29:30,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629690427] [2022-07-20 21:29:30,394 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 21:29:30,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:29:30,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:29:30,395 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:29:30,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-20 21:29:30,467 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 21:29:30,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:29:30,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 21:29:30,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:29:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-20 21:29:30,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:29:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-20 21:29:30,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:29:30,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629690427] [2022-07-20 21:29:30,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629690427] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:29:30,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:29:30,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-20 21:29:30,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180537245] [2022-07-20 21:29:30,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:29:30,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 21:29:30,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:29:30,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 21:29:30,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-20 21:29:30,773 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 21:29:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:29:30,980 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-07-20 21:29:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 21:29:30,981 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2022-07-20 21:29:30,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:29:30,981 INFO L225 Difference]: With dead ends: 64 [2022-07-20 21:29:30,981 INFO L226 Difference]: Without dead ends: 33 [2022-07-20 21:29:30,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-07-20 21:29:30,982 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 21:29:30,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 118 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 21:29:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-20 21:29:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-07-20 21:29:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 21:29:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-07-20 21:29:30,991 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 45 [2022-07-20 21:29:30,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:29:30,991 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-07-20 21:29:30,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 21:29:30,991 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-07-20 21:29:30,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 21:29:30,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:29:30,992 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:29:31,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-20 21:29:31,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:29:31,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:29:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:29:31,201 INFO L85 PathProgramCache]: Analyzing trace with hash -457868326, now seen corresponding path program 5 times [2022-07-20 21:29:31,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:29:31,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871797846] [2022-07-20 21:29:31,201 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 21:29:31,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:29:31,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:29:31,203 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:29:31,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-20 21:29:31,310 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-20 21:29:31,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:29:31,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 21:29:31,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:29:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-20 21:29:31,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:29:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-20 21:29:31,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 21:29:31,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871797846] [2022-07-20 21:29:31,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871797846] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:29:31,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 21:29:31,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2022-07-20 21:29:31,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771301002] [2022-07-20 21:29:31,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 21:29:31,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 21:29:31,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 21:29:31,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 21:29:31,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-20 21:29:31,679 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 21:29:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:29:32,131 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2022-07-20 21:29:32,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 21:29:32,131 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2022-07-20 21:29:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:29:32,132 INFO L225 Difference]: With dead ends: 101 [2022-07-20 21:29:32,132 INFO L226 Difference]: Without dead ends: 82 [2022-07-20 21:29:32,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2022-07-20 21:29:32,133 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 137 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 21:29:32,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 136 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 21:29:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-20 21:29:32,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2022-07-20 21:29:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 50 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-20 21:29:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-07-20 21:29:32,139 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 49 [2022-07-20 21:29:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:29:32,139 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-07-20 21:29:32,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 21:29:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-07-20 21:29:32,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 21:29:32,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:29:32,141 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:29:32,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-20 21:29:32,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 21:29:32,342 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:29:32,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:29:32,342 INFO L85 PathProgramCache]: Analyzing trace with hash -376141416, now seen corresponding path program 6 times [2022-07-20 21:29:32,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 21:29:32,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237203098] [2022-07-20 21:29:32,342 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 21:29:32,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 21:29:32,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 21:29:32,344 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 21:29:32,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 21:29:32,549 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-07-20 21:29:32,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:29:32,556 WARN L261 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-20 21:29:32,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:29:33,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:33,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:33,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:33,005 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:29:33,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 37 [2022-07-20 21:29:33,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:29:33,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:33,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:33,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:33,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:33,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:33,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:29:33,379 INFO L356 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-07-20 21:29:33,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 74 [2022-07-20 21:29:33,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:33,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:33,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:33,575 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:29:33,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 51 [2022-07-20 21:29:33,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:33,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:29:33,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:33,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:29:33,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:29:33,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 63 [2022-07-20 21:29:34,087 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 21:29:34,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 34 [2022-07-20 21:29:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-20 21:29:34,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:29:46,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 159 [2022-07-20 21:29:46,273 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-20 21:29:46,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7548080 treesize of output 4871344 [2022-07-20 21:33:09,124 WARN L233 SmtUtils]: Spent 3.38m on a formula simplification. DAG size of input: 376 DAG size of output: 376 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)