./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/ntdrivers-simplified/diskperf_simpl1.cil.c -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 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:29:30,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:29:30,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:29:30,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:29:30,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:29:30,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:29:30,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:29:30,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:29:30,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:29:30,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:29:30,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:29:30,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:29:30,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:29:30,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:29:30,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:29:30,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:29:30,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:29:30,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:29:30,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:29:30,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:29:30,598 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:29:30,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:29:30,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:29:30,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:29:30,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:29:30,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:29:30,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:29:30,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:29:30,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:29:30,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:29:30,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:29:30,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:29:30,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:29:30,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:29:30,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:29:30,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:29:30,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:29:30,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:29:30,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:29:30,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:29:30,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:29:30,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:29:30,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:29:30,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:29:30,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:29:30,649 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:29:30,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:29:30,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:29:30,650 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:29:30,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:29:30,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:29:30,651 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:29:30,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:29:30,652 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:29:30,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:29:30,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:29:30,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:29:30,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:29:30,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:29:30,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:29:30,654 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:29:30,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:29:30,654 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:29:30,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:29:30,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:29:30,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:29:30,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:29:30,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:29:30,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:29:30,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:29:30,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:29:30,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:29:30,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:29:30,656 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:29:30,657 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:29:30,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:29:30,657 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 -> 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c [2022-07-13 11:29:30,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:29:30,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:29:30,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:29:30,878 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:29:30,878 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:29:30,879 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-07-13 11:29:30,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03fc5240d/125cfd582c60428fb29ae74f38c521b7/FLAG75be5f7c3 [2022-07-13 11:29:31,346 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:29:31,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-07-13 11:29:31,357 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03fc5240d/125cfd582c60428fb29ae74f38c521b7/FLAG75be5f7c3 [2022-07-13 11:29:31,366 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03fc5240d/125cfd582c60428fb29ae74f38c521b7 [2022-07-13 11:29:31,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:29:31,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:29:31,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:29:31,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:29:31,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:29:31,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:29:31" (1/1) ... [2022-07-13 11:29:31,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e6dbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:31, skipping insertion in model container [2022-07-13 11:29:31,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:29:31" (1/1) ... [2022-07-13 11:29:31,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:29:31,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:29:31,554 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/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2022-07-13 11:29:31,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:29:31,698 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:29:31,724 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/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2022-07-13 11:29:31,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:29:31,803 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:29:31,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:31 WrapperNode [2022-07-13 11:29:31,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:29:31,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:29:31,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:29:31,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:29:31,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:31" (1/1) ... [2022-07-13 11:29:31,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:31" (1/1) ... [2022-07-13 11:29:31,864 INFO L137 Inliner]: procedures = 38, calls = 66, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 755 [2022-07-13 11:29:31,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:29:31,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:29:31,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:29:31,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:29:31,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:31" (1/1) ... [2022-07-13 11:29:31,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:31" (1/1) ... [2022-07-13 11:29:31,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:31" (1/1) ... [2022-07-13 11:29:31,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:31" (1/1) ... [2022-07-13 11:29:31,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:31" (1/1) ... [2022-07-13 11:29:31,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:31" (1/1) ... [2022-07-13 11:29:31,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:31" (1/1) ... [2022-07-13 11:29:31,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:29:31,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:29:31,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:29:31,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:29:31,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:31" (1/1) ... [2022-07-13 11:29:31,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:29:31,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:29:31,945 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-13 11:29:31,958 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-13 11:29:31,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:29:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-13 11:29:31,991 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-13 11:29:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-07-13 11:29:31,991 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-07-13 11:29:31,991 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-13 11:29:31,992 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-13 11:29:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-07-13 11:29:31,992 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-07-13 11:29:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2022-07-13 11:29:31,992 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2022-07-13 11:29:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-13 11:29:31,993 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-13 11:29:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:29:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-13 11:29:31,993 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-13 11:29:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2022-07-13 11:29:31,993 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2022-07-13 11:29:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2022-07-13 11:29:31,994 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2022-07-13 11:29:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:29:31,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:29:32,189 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:29:32,190 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:29:32,194 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:29:32,243 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-13 11:29:32,243 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-13 11:29:32,245 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:29:32,262 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-07-13 11:29:32,263 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-07-13 11:29:32,311 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:29:32,321 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:29:32,333 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:29:32,707 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2022-07-13 11:29:32,708 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2022-07-13 11:29:32,708 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-13 11:29:32,708 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-13 11:29:32,708 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2022-07-13 11:29:32,708 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2022-07-13 11:29:32,712 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:29:32,738 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-07-13 11:29:32,739 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-07-13 11:29:32,775 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:29:32,788 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:29:32,788 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:29:32,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:29:32 BoogieIcfgContainer [2022-07-13 11:29:32,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:29:32,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:29:32,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:29:32,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:29:32,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:29:31" (1/3) ... [2022-07-13 11:29:32,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55607cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:29:32, skipping insertion in model container [2022-07-13 11:29:32,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:29:31" (2/3) ... [2022-07-13 11:29:32,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55607cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:29:32, skipping insertion in model container [2022-07-13 11:29:32,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:29:32" (3/3) ... [2022-07-13 11:29:32,797 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2022-07-13 11:29:32,809 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:29:32,809 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:29:32,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:29:32,859 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@50574206, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@235e3c2 [2022-07-13 11:29:32,859 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:29:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 188 states have (on average 1.4680851063829787) internal successors, (276), 205 states have internal predecessors, (276), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2022-07-13 11:29:32,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 11:29:32,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:32,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:32,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:32,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:32,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1911400740, now seen corresponding path program 1 times [2022-07-13 11:29:32,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:32,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380908929] [2022-07-13 11:29:32,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:32,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:33,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:33,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380908929] [2022-07-13 11:29:33,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380908929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:33,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:33,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:29:33,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886461448] [2022-07-13 11:29:33,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:33,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:29:33,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:33,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:29:33,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:29:33,107 INFO L87 Difference]: Start difference. First operand has 243 states, 188 states have (on average 1.4680851063829787) internal successors, (276), 205 states have internal predecessors, (276), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:33,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:33,270 INFO L93 Difference]: Finished difference Result 449 states and 690 transitions. [2022-07-13 11:29:33,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:29:33,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 11:29:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:33,290 INFO L225 Difference]: With dead ends: 449 [2022-07-13 11:29:33,290 INFO L226 Difference]: Without dead ends: 236 [2022-07-13 11:29:33,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-13 11:29:33,302 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 8 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:33,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 635 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:33,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-13 11:29:33,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2022-07-13 11:29:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 183 states have (on average 1.4098360655737705) internal successors, (258), 198 states have internal predecessors, (258), 44 states have call successors, (44), 9 states have call predecessors, (44), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-13 11:29:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 332 transitions. [2022-07-13 11:29:33,380 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 332 transitions. Word has length 13 [2022-07-13 11:29:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:33,380 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 332 transitions. [2022-07-13 11:29:33,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 332 transitions. [2022-07-13 11:29:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 11:29:33,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:33,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:33,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:29:33,383 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:33,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1078790828, now seen corresponding path program 1 times [2022-07-13 11:29:33,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:33,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900420675] [2022-07-13 11:29:33,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:33,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:33,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:33,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900420675] [2022-07-13 11:29:33,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900420675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:33,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:33,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:29:33,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671916426] [2022-07-13 11:29:33,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:33,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:29:33,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:33,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:29:33,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:29:33,485 INFO L87 Difference]: Start difference. First operand 236 states and 332 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:33,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:33,588 INFO L93 Difference]: Finished difference Result 536 states and 777 transitions. [2022-07-13 11:29:33,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:29:33,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-13 11:29:33,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:33,594 INFO L225 Difference]: With dead ends: 536 [2022-07-13 11:29:33,594 INFO L226 Difference]: Without dead ends: 377 [2022-07-13 11:29:33,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:29:33,596 INFO L413 NwaCegarLoop]: 455 mSDtfsCounter, 250 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:33,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 680 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-13 11:29:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 357. [2022-07-13 11:29:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 283 states have (on average 1.3851590106007068) internal successors, (392), 291 states have internal predecessors, (392), 59 states have call successors, (59), 16 states have call predecessors, (59), 14 states have return successors, (67), 51 states have call predecessors, (67), 48 states have call successors, (67) [2022-07-13 11:29:33,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 518 transitions. [2022-07-13 11:29:33,622 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 518 transitions. Word has length 15 [2022-07-13 11:29:33,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:33,623 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 518 transitions. [2022-07-13 11:29:33,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:33,623 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 518 transitions. [2022-07-13 11:29:33,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 11:29:33,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:33,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:33,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:29:33,625 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:33,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:33,625 INFO L85 PathProgramCache]: Analyzing trace with hash -320586800, now seen corresponding path program 1 times [2022-07-13 11:29:33,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:33,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754339508] [2022-07-13 11:29:33,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:33,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:33,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:33,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754339508] [2022-07-13 11:29:33,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754339508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:33,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:33,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:29:33,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45167756] [2022-07-13 11:29:33,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:33,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:29:33,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:29:33,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:29:33,696 INFO L87 Difference]: Start difference. First operand 357 states and 518 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:33,727 INFO L93 Difference]: Finished difference Result 823 states and 1229 transitions. [2022-07-13 11:29:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:29:33,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 11:29:33,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:33,732 INFO L225 Difference]: With dead ends: 823 [2022-07-13 11:29:33,732 INFO L226 Difference]: Without dead ends: 550 [2022-07-13 11:29:33,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:29:33,735 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 255 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:33,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 578 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:29:33,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-07-13 11:29:33,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 519. [2022-07-13 11:29:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 411 states have (on average 1.389294403892944) internal successors, (571), 418 states have internal predecessors, (571), 84 states have call successors, (84), 24 states have call predecessors, (84), 23 states have return successors, (117), 77 states have call predecessors, (117), 74 states have call successors, (117) [2022-07-13 11:29:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 772 transitions. [2022-07-13 11:29:33,763 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 772 transitions. Word has length 20 [2022-07-13 11:29:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:33,764 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 772 transitions. [2022-07-13 11:29:33,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 772 transitions. [2022-07-13 11:29:33,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:29:33,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:33,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:33,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:29:33,766 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:33,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:33,767 INFO L85 PathProgramCache]: Analyzing trace with hash -175921138, now seen corresponding path program 1 times [2022-07-13 11:29:33,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:33,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065115418] [2022-07-13 11:29:33,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:33,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:33,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:33,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065115418] [2022-07-13 11:29:33,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065115418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:33,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:33,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:29:33,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95784342] [2022-07-13 11:29:33,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:33,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:29:33,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:33,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:29:33,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:29:33,804 INFO L87 Difference]: Start difference. First operand 519 states and 772 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:33,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:33,858 INFO L93 Difference]: Finished difference Result 534 states and 792 transitions. [2022-07-13 11:29:33,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:29:33,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-13 11:29:33,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:33,862 INFO L225 Difference]: With dead ends: 534 [2022-07-13 11:29:33,863 INFO L226 Difference]: Without dead ends: 530 [2022-07-13 11:29:33,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-13 11:29:33,864 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 21 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:33,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 557 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:29:33,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-07-13 11:29:33,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 529. [2022-07-13 11:29:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 422 states have (on average 1.386255924170616) internal successors, (585), 427 states have internal predecessors, (585), 83 states have call successors, (83), 25 states have call predecessors, (83), 23 states have return successors, (117), 77 states have call predecessors, (117), 74 states have call successors, (117) [2022-07-13 11:29:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 785 transitions. [2022-07-13 11:29:33,889 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 785 transitions. Word has length 24 [2022-07-13 11:29:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:33,889 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 785 transitions. [2022-07-13 11:29:33,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 785 transitions. [2022-07-13 11:29:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 11:29:33,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:33,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:33,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:29:33,891 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:33,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:33,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1035800982, now seen corresponding path program 1 times [2022-07-13 11:29:33,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:33,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613560953] [2022-07-13 11:29:33,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:33,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:33,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 11:29:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:33,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:33,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613560953] [2022-07-13 11:29:33,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613560953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:33,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:33,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:29:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780201095] [2022-07-13 11:29:33,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:33,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:29:33,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:33,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:29:33,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:29:33,985 INFO L87 Difference]: Start difference. First operand 529 states and 785 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:34,331 INFO L93 Difference]: Finished difference Result 582 states and 861 transitions. [2022-07-13 11:29:34,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:29:34,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-13 11:29:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:34,336 INFO L225 Difference]: With dead ends: 582 [2022-07-13 11:29:34,336 INFO L226 Difference]: Without dead ends: 571 [2022-07-13 11:29:34,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:29:34,337 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 410 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:34,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 798 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:34,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-07-13 11:29:34,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 556. [2022-07-13 11:29:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 447 states have (on average 1.3803131991051454) internal successors, (617), 454 states have internal predecessors, (617), 83 states have call successors, (83), 25 states have call predecessors, (83), 25 states have return successors, (126), 77 states have call predecessors, (126), 74 states have call successors, (126) [2022-07-13 11:29:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 826 transitions. [2022-07-13 11:29:34,380 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 826 transitions. Word has length 27 [2022-07-13 11:29:34,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:34,380 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 826 transitions. [2022-07-13 11:29:34,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 826 transitions. [2022-07-13 11:29:34,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:29:34,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:34,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:34,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:29:34,382 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:34,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:34,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1813713707, now seen corresponding path program 1 times [2022-07-13 11:29:34,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:34,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120138103] [2022-07-13 11:29:34,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:34,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:34,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 11:29:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:34,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:34,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120138103] [2022-07-13 11:29:34,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120138103] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:34,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:34,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:29:34,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396305032] [2022-07-13 11:29:34,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:34,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:29:34,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:34,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:29:34,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:29:34,458 INFO L87 Difference]: Start difference. First operand 556 states and 826 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:34,763 INFO L93 Difference]: Finished difference Result 579 states and 854 transitions. [2022-07-13 11:29:34,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:29:34,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-07-13 11:29:34,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:34,767 INFO L225 Difference]: With dead ends: 579 [2022-07-13 11:29:34,767 INFO L226 Difference]: Without dead ends: 571 [2022-07-13 11:29:34,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:29:34,769 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 408 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:34,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 799 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:34,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-07-13 11:29:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 556. [2022-07-13 11:29:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 447 states have (on average 1.378076062639821) internal successors, (616), 454 states have internal predecessors, (616), 83 states have call successors, (83), 25 states have call predecessors, (83), 25 states have return successors, (126), 77 states have call predecessors, (126), 74 states have call successors, (126) [2022-07-13 11:29:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 825 transitions. [2022-07-13 11:29:34,799 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 825 transitions. Word has length 28 [2022-07-13 11:29:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:34,800 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 825 transitions. [2022-07-13 11:29:34,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 825 transitions. [2022-07-13 11:29:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 11:29:34,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:34,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:34,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:29:34,802 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:34,803 INFO L85 PathProgramCache]: Analyzing trace with hash 123360193, now seen corresponding path program 1 times [2022-07-13 11:29:34,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:34,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454143059] [2022-07-13 11:29:34,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:34,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:34,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 11:29:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:34,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:34,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454143059] [2022-07-13 11:29:34,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454143059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:34,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:34,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:29:34,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257208572] [2022-07-13 11:29:34,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:34,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:29:34,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:34,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:29:34,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:29:34,861 INFO L87 Difference]: Start difference. First operand 556 states and 825 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:35,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:35,091 INFO L93 Difference]: Finished difference Result 1018 states and 1542 transitions. [2022-07-13 11:29:35,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:29:35,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-07-13 11:29:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:35,097 INFO L225 Difference]: With dead ends: 1018 [2022-07-13 11:29:35,097 INFO L226 Difference]: Without dead ends: 989 [2022-07-13 11:29:35,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:29:35,098 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 417 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:35,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 772 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:35,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2022-07-13 11:29:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 949. [2022-07-13 11:29:35,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 759 states have (on average 1.391304347826087) internal successors, (1056), 766 states have internal predecessors, (1056), 141 states have call successors, (141), 47 states have call predecessors, (141), 48 states have return successors, (249), 137 states have call predecessors, (249), 132 states have call successors, (249) [2022-07-13 11:29:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1446 transitions. [2022-07-13 11:29:35,183 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1446 transitions. Word has length 29 [2022-07-13 11:29:35,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:35,186 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1446 transitions. [2022-07-13 11:29:35,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1446 transitions. [2022-07-13 11:29:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 11:29:35,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:35,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:35,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:29:35,188 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:35,188 INFO L85 PathProgramCache]: Analyzing trace with hash -462412845, now seen corresponding path program 1 times [2022-07-13 11:29:35,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:35,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760317616] [2022-07-13 11:29:35,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:35,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:35,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 11:29:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:35,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:35,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760317616] [2022-07-13 11:29:35,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760317616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:35,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:35,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:29:35,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717793109] [2022-07-13 11:29:35,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:35,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:29:35,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:35,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:29:35,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:29:35,223 INFO L87 Difference]: Start difference. First operand 949 states and 1446 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:35,402 INFO L93 Difference]: Finished difference Result 985 states and 1494 transitions. [2022-07-13 11:29:35,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:29:35,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-07-13 11:29:35,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:35,408 INFO L225 Difference]: With dead ends: 985 [2022-07-13 11:29:35,408 INFO L226 Difference]: Without dead ends: 966 [2022-07-13 11:29:35,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:29:35,409 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 84 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:35,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 998 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:35,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-07-13 11:29:35,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 945. [2022-07-13 11:29:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 756 states have (on average 1.3915343915343916) internal successors, (1052), 763 states have internal predecessors, (1052), 140 states have call successors, (140), 47 states have call predecessors, (140), 48 states have return successors, (248), 136 states have call predecessors, (248), 131 states have call successors, (248) [2022-07-13 11:29:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1440 transitions. [2022-07-13 11:29:35,471 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1440 transitions. Word has length 30 [2022-07-13 11:29:35,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:35,472 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1440 transitions. [2022-07-13 11:29:35,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1440 transitions. [2022-07-13 11:29:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:29:35,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:35,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:35,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:29:35,476 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:35,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:35,476 INFO L85 PathProgramCache]: Analyzing trace with hash 415913558, now seen corresponding path program 1 times [2022-07-13 11:29:35,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:35,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174486344] [2022-07-13 11:29:35,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:35,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:35,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:35,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174486344] [2022-07-13 11:29:35,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174486344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:35,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:35,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:29:35,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283364233] [2022-07-13 11:29:35,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:35,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:29:35,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:35,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:29:35,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:29:35,528 INFO L87 Difference]: Start difference. First operand 945 states and 1440 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:35,559 INFO L93 Difference]: Finished difference Result 1334 states and 2062 transitions. [2022-07-13 11:29:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:29:35,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-13 11:29:35,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:35,563 INFO L225 Difference]: With dead ends: 1334 [2022-07-13 11:29:35,563 INFO L226 Difference]: Without dead ends: 510 [2022-07-13 11:29:35,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-13 11:29:35,566 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 264 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:35,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 270 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:29:35,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-07-13 11:29:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-07-13 11:29:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 408 states have (on average 1.3553921568627452) internal successors, (553), 414 states have internal predecessors, (553), 78 states have call successors, (78), 23 states have call predecessors, (78), 23 states have return successors, (123), 73 states have call predecessors, (123), 71 states have call successors, (123) [2022-07-13 11:29:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 754 transitions. [2022-07-13 11:29:35,590 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 754 transitions. Word has length 34 [2022-07-13 11:29:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:35,590 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 754 transitions. [2022-07-13 11:29:35,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 754 transitions. [2022-07-13 11:29:35,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:29:35,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:35,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:35,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:29:35,592 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:35,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:35,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2105808494, now seen corresponding path program 1 times [2022-07-13 11:29:35,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:35,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696935074] [2022-07-13 11:29:35,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:35,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:35,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 11:29:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:35,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:35,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696935074] [2022-07-13 11:29:35,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696935074] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:35,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:35,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:29:35,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327459333] [2022-07-13 11:29:35,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:35,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:29:35,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:35,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:29:35,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:29:35,634 INFO L87 Difference]: Start difference. First operand 510 states and 754 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:35,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:35,805 INFO L93 Difference]: Finished difference Result 553 states and 805 transitions. [2022-07-13 11:29:35,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:29:35,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-13 11:29:35,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:35,808 INFO L225 Difference]: With dead ends: 553 [2022-07-13 11:29:35,809 INFO L226 Difference]: Without dead ends: 519 [2022-07-13 11:29:35,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:29:35,810 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 94 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:35,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1167 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:35,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-07-13 11:29:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2022-07-13 11:29:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 407 states have (on average 1.3513513513513513) internal successors, (550), 413 states have internal predecessors, (550), 77 states have call successors, (77), 23 states have call predecessors, (77), 23 states have return successors, (122), 72 states have call predecessors, (122), 70 states have call successors, (122) [2022-07-13 11:29:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 749 transitions. [2022-07-13 11:29:35,840 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 749 transitions. Word has length 34 [2022-07-13 11:29:35,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:35,840 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 749 transitions. [2022-07-13 11:29:35,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 749 transitions. [2022-07-13 11:29:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:29:35,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:35,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:35,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:29:35,843 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:35,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:35,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1486754927, now seen corresponding path program 1 times [2022-07-13 11:29:35,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:35,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526433070] [2022-07-13 11:29:35,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:35,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:35,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 11:29:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:35,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:35,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526433070] [2022-07-13 11:29:35,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526433070] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:35,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:35,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:29:35,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63288827] [2022-07-13 11:29:35,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:35,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:29:35,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:35,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:29:35,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:29:35,899 INFO L87 Difference]: Start difference. First operand 508 states and 749 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:36,224 INFO L93 Difference]: Finished difference Result 720 states and 1102 transitions. [2022-07-13 11:29:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:29:36,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-13 11:29:36,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:36,230 INFO L225 Difference]: With dead ends: 720 [2022-07-13 11:29:36,230 INFO L226 Difference]: Without dead ends: 712 [2022-07-13 11:29:36,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:29:36,231 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 232 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:36,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 668 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-07-13 11:29:36,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 566. [2022-07-13 11:29:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 455 states have (on average 1.3516483516483517) internal successors, (615), 461 states have internal predecessors, (615), 84 states have call successors, (84), 25 states have call predecessors, (84), 26 states have return successors, (142), 80 states have call predecessors, (142), 77 states have call successors, (142) [2022-07-13 11:29:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 841 transitions. [2022-07-13 11:29:36,270 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 841 transitions. Word has length 34 [2022-07-13 11:29:36,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:36,270 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 841 transitions. [2022-07-13 11:29:36,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:36,271 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 841 transitions. [2022-07-13 11:29:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 11:29:36,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:36,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:36,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:29:36,272 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:36,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:36,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1608594996, now seen corresponding path program 1 times [2022-07-13 11:29:36,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:36,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930784730] [2022-07-13 11:29:36,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:36,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:36,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 11:29:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:36,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:36,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930784730] [2022-07-13 11:29:36,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930784730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:36,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:36,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:29:36,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762182212] [2022-07-13 11:29:36,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:36,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:29:36,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:36,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:29:36,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:36,328 INFO L87 Difference]: Start difference. First operand 566 states and 841 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:36,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:36,682 INFO L93 Difference]: Finished difference Result 583 states and 860 transitions. [2022-07-13 11:29:36,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:29:36,683 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-13 11:29:36,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:36,686 INFO L225 Difference]: With dead ends: 583 [2022-07-13 11:29:36,686 INFO L226 Difference]: Without dead ends: 579 [2022-07-13 11:29:36,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:29:36,688 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 66 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:36,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1471 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-07-13 11:29:36,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 574. [2022-07-13 11:29:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 463 states have (on average 1.349892008639309) internal successors, (625), 469 states have internal predecessors, (625), 84 states have call successors, (84), 25 states have call predecessors, (84), 26 states have return successors, (142), 80 states have call predecessors, (142), 77 states have call successors, (142) [2022-07-13 11:29:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 851 transitions. [2022-07-13 11:29:36,721 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 851 transitions. Word has length 35 [2022-07-13 11:29:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:36,722 INFO L495 AbstractCegarLoop]: Abstraction has 574 states and 851 transitions. [2022-07-13 11:29:36,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 851 transitions. [2022-07-13 11:29:36,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 11:29:36,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:36,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:36,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:29:36,723 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:36,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1608318166, now seen corresponding path program 1 times [2022-07-13 11:29:36,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:36,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332962147] [2022-07-13 11:29:36,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:36,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:36,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 11:29:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:36,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:36,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332962147] [2022-07-13 11:29:36,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332962147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:36,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:36,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:29:36,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626313943] [2022-07-13 11:29:36,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:36,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:29:36,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:36,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:29:36,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:36,798 INFO L87 Difference]: Start difference. First operand 574 states and 851 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:37,095 INFO L93 Difference]: Finished difference Result 1065 states and 1652 transitions. [2022-07-13 11:29:37,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:29:37,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-13 11:29:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:37,099 INFO L225 Difference]: With dead ends: 1065 [2022-07-13 11:29:37,099 INFO L226 Difference]: Without dead ends: 605 [2022-07-13 11:29:37,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:29:37,103 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 75 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:37,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1572 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:37,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-07-13 11:29:37,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 586. [2022-07-13 11:29:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 474 states have (on average 1.3544303797468353) internal successors, (642), 481 states have internal predecessors, (642), 84 states have call successors, (84), 25 states have call predecessors, (84), 27 states have return successors, (161), 80 states have call predecessors, (161), 77 states have call successors, (161) [2022-07-13 11:29:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 887 transitions. [2022-07-13 11:29:37,140 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 887 transitions. Word has length 35 [2022-07-13 11:29:37,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:37,141 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 887 transitions. [2022-07-13 11:29:37,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 887 transitions. [2022-07-13 11:29:37,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:29:37,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:37,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:37,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:29:37,143 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:37,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:37,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1299938960, now seen corresponding path program 1 times [2022-07-13 11:29:37,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:37,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233725037] [2022-07-13 11:29:37,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:37,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:37,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:37,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233725037] [2022-07-13 11:29:37,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233725037] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:37,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:37,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:29:37,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145557583] [2022-07-13 11:29:37,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:37,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:29:37,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:37,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:29:37,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:29:37,204 INFO L87 Difference]: Start difference. First operand 586 states and 887 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:37,323 INFO L93 Difference]: Finished difference Result 610 states and 910 transitions. [2022-07-13 11:29:37,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:29:37,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-13 11:29:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:37,335 INFO L225 Difference]: With dead ends: 610 [2022-07-13 11:29:37,336 INFO L226 Difference]: Without dead ends: 582 [2022-07-13 11:29:37,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:29:37,337 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 270 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:37,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 410 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-07-13 11:29:37,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2022-07-13 11:29:37,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 468 states have (on average 1.3525641025641026) internal successors, (633), 476 states have internal predecessors, (633), 84 states have call successors, (84), 25 states have call predecessors, (84), 27 states have return successors, (159), 79 states have call predecessors, (159), 77 states have call successors, (159) [2022-07-13 11:29:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 876 transitions. [2022-07-13 11:29:37,375 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 876 transitions. Word has length 34 [2022-07-13 11:29:37,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:37,376 INFO L495 AbstractCegarLoop]: Abstraction has 580 states and 876 transitions. [2022-07-13 11:29:37,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:37,376 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 876 transitions. [2022-07-13 11:29:37,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 11:29:37,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:37,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:37,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:29:37,378 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:37,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:37,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1171529217, now seen corresponding path program 1 times [2022-07-13 11:29:37,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:37,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321312557] [2022-07-13 11:29:37,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:37,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:37,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 11:29:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:37,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:37,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321312557] [2022-07-13 11:29:37,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321312557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:37,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:37,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:29:37,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796665296] [2022-07-13 11:29:37,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:37,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:29:37,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:37,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:29:37,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:29:37,438 INFO L87 Difference]: Start difference. First operand 580 states and 876 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:37,955 INFO L93 Difference]: Finished difference Result 738 states and 1149 transitions. [2022-07-13 11:29:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:29:37,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-13 11:29:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:37,959 INFO L225 Difference]: With dead ends: 738 [2022-07-13 11:29:37,959 INFO L226 Difference]: Without dead ends: 721 [2022-07-13 11:29:37,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:29:37,960 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 662 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:37,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 768 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:29:37,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-07-13 11:29:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 567. [2022-07-13 11:29:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 457 states have (on average 1.3544857768052516) internal successors, (619), 464 states have internal predecessors, (619), 83 states have call successors, (83), 25 states have call predecessors, (83), 26 states have return successors, (140), 78 states have call predecessors, (140), 76 states have call successors, (140) [2022-07-13 11:29:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 842 transitions. [2022-07-13 11:29:37,998 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 842 transitions. Word has length 36 [2022-07-13 11:29:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:37,998 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 842 transitions. [2022-07-13 11:29:37,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 842 transitions. [2022-07-13 11:29:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 11:29:38,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:38,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:38,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:29:38,000 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:38,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2056934280, now seen corresponding path program 1 times [2022-07-13 11:29:38,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:38,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250758475] [2022-07-13 11:29:38,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:38,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:38,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:29:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:38,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:38,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250758475] [2022-07-13 11:29:38,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250758475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:38,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:38,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:29:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378793709] [2022-07-13 11:29:38,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:38,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:29:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:38,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:29:38,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:29:38,037 INFO L87 Difference]: Start difference. First operand 567 states and 842 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:38,246 INFO L93 Difference]: Finished difference Result 630 states and 904 transitions. [2022-07-13 11:29:38,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:29:38,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-07-13 11:29:38,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:38,253 INFO L225 Difference]: With dead ends: 630 [2022-07-13 11:29:38,253 INFO L226 Difference]: Without dead ends: 377 [2022-07-13 11:29:38,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:38,255 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 315 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:38,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 650 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-13 11:29:38,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 359. [2022-07-13 11:29:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 295 states have (on average 1.3016949152542372) internal successors, (384), 302 states have internal predecessors, (384), 47 states have call successors, (47), 17 states have call predecessors, (47), 16 states have return successors, (61), 40 states have call predecessors, (61), 40 states have call successors, (61) [2022-07-13 11:29:38,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 492 transitions. [2022-07-13 11:29:38,279 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 492 transitions. Word has length 39 [2022-07-13 11:29:38,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:38,280 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 492 transitions. [2022-07-13 11:29:38,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:38,280 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 492 transitions. [2022-07-13 11:29:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 11:29:38,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:38,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:38,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:29:38,281 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:38,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:38,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1922765712, now seen corresponding path program 1 times [2022-07-13 11:29:38,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:38,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209477269] [2022-07-13 11:29:38,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:38,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:38,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:38,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209477269] [2022-07-13 11:29:38,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209477269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:38,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:38,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:29:38,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355316436] [2022-07-13 11:29:38,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:38,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:29:38,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:38,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:29:38,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:29:38,307 INFO L87 Difference]: Start difference. First operand 359 states and 492 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:38,397 INFO L93 Difference]: Finished difference Result 504 states and 710 transitions. [2022-07-13 11:29:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:29:38,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-13 11:29:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:38,400 INFO L225 Difference]: With dead ends: 504 [2022-07-13 11:29:38,400 INFO L226 Difference]: Without dead ends: 491 [2022-07-13 11:29:38,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-13 11:29:38,401 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 161 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:38,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 638 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-13 11:29:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 375. [2022-07-13 11:29:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 310 states have (on average 1.2903225806451613) internal successors, (400), 317 states have internal predecessors, (400), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (62), 41 states have call predecessors, (62), 40 states have call successors, (62) [2022-07-13 11:29:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 509 transitions. [2022-07-13 11:29:38,432 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 509 transitions. Word has length 35 [2022-07-13 11:29:38,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:38,432 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 509 transitions. [2022-07-13 11:29:38,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 509 transitions. [2022-07-13 11:29:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 11:29:38,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:38,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:38,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:29:38,434 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:38,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:38,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1798212464, now seen corresponding path program 1 times [2022-07-13 11:29:38,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:38,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719327655] [2022-07-13 11:29:38,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:38,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:38,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:38,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:38,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719327655] [2022-07-13 11:29:38,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719327655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:38,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:38,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:29:38,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652942880] [2022-07-13 11:29:38,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:38,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:29:38,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:38,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:29:38,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:29:38,469 INFO L87 Difference]: Start difference. First operand 375 states and 509 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:38,580 INFO L93 Difference]: Finished difference Result 387 states and 521 transitions. [2022-07-13 11:29:38,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:29:38,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-13 11:29:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:38,583 INFO L225 Difference]: With dead ends: 387 [2022-07-13 11:29:38,583 INFO L226 Difference]: Without dead ends: 353 [2022-07-13 11:29:38,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:29:38,584 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 262 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:38,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 411 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:38,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-07-13 11:29:38,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2022-07-13 11:29:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 288 states have (on average 1.28125) internal successors, (369), 294 states have internal predecessors, (369), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (61), 40 states have call predecessors, (61), 40 states have call successors, (61) [2022-07-13 11:29:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 476 transitions. [2022-07-13 11:29:38,607 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 476 transitions. Word has length 35 [2022-07-13 11:29:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:38,607 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 476 transitions. [2022-07-13 11:29:38,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 476 transitions. [2022-07-13 11:29:38,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:29:38,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:38,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:38,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:29:38,609 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:38,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1722219638, now seen corresponding path program 1 times [2022-07-13 11:29:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:38,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545067322] [2022-07-13 11:29:38,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:38,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:38,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 11:29:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:38,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:38,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545067322] [2022-07-13 11:29:38,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545067322] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:38,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:38,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:29:38,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963317602] [2022-07-13 11:29:38,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:38,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:29:38,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:38,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:29:38,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:38,657 INFO L87 Difference]: Start difference. First operand 351 states and 476 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:38,923 INFO L93 Difference]: Finished difference Result 355 states and 479 transitions. [2022-07-13 11:29:38,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:29:38,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-07-13 11:29:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:38,926 INFO L225 Difference]: With dead ends: 355 [2022-07-13 11:29:38,926 INFO L226 Difference]: Without dead ends: 324 [2022-07-13 11:29:38,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:29:38,927 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 60 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:38,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1424 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-13 11:29:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2022-07-13 11:29:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 263 states have (on average 1.2889733840304183) internal successors, (339), 269 states have internal predecessors, (339), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (60), 39 states have call predecessors, (60), 39 states have call successors, (60) [2022-07-13 11:29:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 444 transitions. [2022-07-13 11:29:38,957 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 444 transitions. Word has length 37 [2022-07-13 11:29:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:38,958 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 444 transitions. [2022-07-13 11:29:38,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 444 transitions. [2022-07-13 11:29:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 11:29:38,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:38,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:38,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:29:38,959 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:38,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:38,960 INFO L85 PathProgramCache]: Analyzing trace with hash -70447595, now seen corresponding path program 1 times [2022-07-13 11:29:38,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:38,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652280511] [2022-07-13 11:29:38,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:38,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:39,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:39,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652280511] [2022-07-13 11:29:39,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652280511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:39,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:39,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:29:39,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098783482] [2022-07-13 11:29:39,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:39,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:29:39,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:39,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:29:39,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:39,034 INFO L87 Difference]: Start difference. First operand 324 states and 444 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:39,128 INFO L93 Difference]: Finished difference Result 345 states and 466 transitions. [2022-07-13 11:29:39,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:29:39,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-13 11:29:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:39,130 INFO L225 Difference]: With dead ends: 345 [2022-07-13 11:29:39,130 INFO L226 Difference]: Without dead ends: 323 [2022-07-13 11:29:39,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:29:39,131 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 43 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:39,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1424 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:29:39,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-13 11:29:39,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-07-13 11:29:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 262 states have (on average 1.286259541984733) internal successors, (337), 268 states have internal predecessors, (337), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (60), 39 states have call predecessors, (60), 39 states have call successors, (60) [2022-07-13 11:29:39,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 442 transitions. [2022-07-13 11:29:39,153 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 442 transitions. Word has length 36 [2022-07-13 11:29:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:39,153 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 442 transitions. [2022-07-13 11:29:39,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 442 transitions. [2022-07-13 11:29:39,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 11:29:39,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:39,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:39,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 11:29:39,154 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:39,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:39,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2018897985, now seen corresponding path program 1 times [2022-07-13 11:29:39,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:39,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322261175] [2022-07-13 11:29:39,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:39,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:39,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 11:29:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:39,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:39,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322261175] [2022-07-13 11:29:39,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322261175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:39,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:39,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:29:39,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595356749] [2022-07-13 11:29:39,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:39,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:29:39,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:39,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:29:39,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:29:39,193 INFO L87 Difference]: Start difference. First operand 323 states and 442 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:39,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:39,361 INFO L93 Difference]: Finished difference Result 352 states and 479 transitions. [2022-07-13 11:29:39,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:29:39,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-07-13 11:29:39,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:39,364 INFO L225 Difference]: With dead ends: 352 [2022-07-13 11:29:39,364 INFO L226 Difference]: Without dead ends: 322 [2022-07-13 11:29:39,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:39,365 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 79 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:39,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1067 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:39,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-07-13 11:29:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 308. [2022-07-13 11:29:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 249 states have (on average 1.2931726907630523) internal successors, (322), 255 states have internal predecessors, (322), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-13 11:29:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 425 transitions. [2022-07-13 11:29:39,386 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 425 transitions. Word has length 38 [2022-07-13 11:29:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:39,387 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 425 transitions. [2022-07-13 11:29:39,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 425 transitions. [2022-07-13 11:29:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:29:39,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:39,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:39,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:29:39,388 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:39,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:39,388 INFO L85 PathProgramCache]: Analyzing trace with hash 233678808, now seen corresponding path program 1 times [2022-07-13 11:29:39,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:39,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277519905] [2022-07-13 11:29:39,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:39,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:39,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:39,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277519905] [2022-07-13 11:29:39,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277519905] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:39,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:39,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:29:39,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25300149] [2022-07-13 11:29:39,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:39,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:29:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:39,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:29:39,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:29:39,442 INFO L87 Difference]: Start difference. First operand 308 states and 425 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:39,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:39,554 INFO L93 Difference]: Finished difference Result 323 states and 441 transitions. [2022-07-13 11:29:39,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:29:39,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-13 11:29:39,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:39,561 INFO L225 Difference]: With dead ends: 323 [2022-07-13 11:29:39,561 INFO L226 Difference]: Without dead ends: 319 [2022-07-13 11:29:39,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:29:39,563 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 46 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:39,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1090 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-13 11:29:39,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2022-07-13 11:29:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 256 states have (on average 1.2890625) internal successors, (330), 262 states have internal predecessors, (330), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-13 11:29:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 433 transitions. [2022-07-13 11:29:39,594 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 433 transitions. Word has length 37 [2022-07-13 11:29:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:39,594 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 433 transitions. [2022-07-13 11:29:39,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 433 transitions. [2022-07-13 11:29:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:29:39,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:39,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:39,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:29:39,596 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:39,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:39,596 INFO L85 PathProgramCache]: Analyzing trace with hash 233401978, now seen corresponding path program 1 times [2022-07-13 11:29:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:39,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293311007] [2022-07-13 11:29:39,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:39,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:39,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:39,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293311007] [2022-07-13 11:29:39,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293311007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:39,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:39,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:29:39,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933855041] [2022-07-13 11:29:39,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:39,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:29:39,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:39,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:29:39,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:29:39,637 INFO L87 Difference]: Start difference. First operand 315 states and 433 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:39,856 INFO L93 Difference]: Finished difference Result 431 states and 618 transitions. [2022-07-13 11:29:39,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:29:39,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-13 11:29:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:39,858 INFO L225 Difference]: With dead ends: 431 [2022-07-13 11:29:39,859 INFO L226 Difference]: Without dead ends: 402 [2022-07-13 11:29:39,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:29:39,860 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 344 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:39,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 504 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:39,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-07-13 11:29:39,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 292. [2022-07-13 11:29:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 233 states have (on average 1.3004291845493563) internal successors, (303), 239 states have internal predecessors, (303), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-13 11:29:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 406 transitions. [2022-07-13 11:29:39,886 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 406 transitions. Word has length 37 [2022-07-13 11:29:39,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:39,886 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 406 transitions. [2022-07-13 11:29:39,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:39,887 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 406 transitions. [2022-07-13 11:29:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:29:39,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:39,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:39,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 11:29:39,888 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:39,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1150124824, now seen corresponding path program 1 times [2022-07-13 11:29:39,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:39,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915080461] [2022-07-13 11:29:39,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:39,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:39,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:29:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:39,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 11:29:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:39,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:39,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915080461] [2022-07-13 11:29:39,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915080461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:39,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:39,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:29:39,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131674693] [2022-07-13 11:29:39,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:39,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:29:39,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:39,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:29:39,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:29:39,935 INFO L87 Difference]: Start difference. First operand 292 states and 406 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:29:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:40,089 INFO L93 Difference]: Finished difference Result 544 states and 787 transitions. [2022-07-13 11:29:40,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:29:40,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-13 11:29:40,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:40,092 INFO L225 Difference]: With dead ends: 544 [2022-07-13 11:29:40,092 INFO L226 Difference]: Without dead ends: 310 [2022-07-13 11:29:40,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:40,094 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 112 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:40,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 635 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:40,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-13 11:29:40,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 302. [2022-07-13 11:29:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 243 states have (on average 1.3045267489711934) internal successors, (317), 248 states have internal predecessors, (317), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-13 11:29:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2022-07-13 11:29:40,121 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 43 [2022-07-13 11:29:40,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:40,122 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2022-07-13 11:29:40,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:29:40,122 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2022-07-13 11:29:40,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:29:40,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:40,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:40,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 11:29:40,123 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:40,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1967801604, now seen corresponding path program 1 times [2022-07-13 11:29:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:40,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704715800] [2022-07-13 11:29:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:40,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:40,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 11:29:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:40,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:40,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704715800] [2022-07-13 11:29:40,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704715800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:40,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:40,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 11:29:40,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573694277] [2022-07-13 11:29:40,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:40,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:29:40,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:40,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:29:40,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:29:40,276 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:40,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:40,584 INFO L93 Difference]: Finished difference Result 333 states and 468 transitions. [2022-07-13 11:29:40,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:29:40,584 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-07-13 11:29:40,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:40,586 INFO L225 Difference]: With dead ends: 333 [2022-07-13 11:29:40,586 INFO L226 Difference]: Without dead ends: 310 [2022-07-13 11:29:40,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:29:40,587 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 77 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:40,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1275 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:40,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-13 11:29:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 301. [2022-07-13 11:29:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 242 states have (on average 1.3016528925619835) internal successors, (315), 247 states have internal predecessors, (315), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-13 11:29:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 418 transitions. [2022-07-13 11:29:40,619 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 418 transitions. Word has length 43 [2022-07-13 11:29:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:40,620 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 418 transitions. [2022-07-13 11:29:40,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 418 transitions. [2022-07-13 11:29:40,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:29:40,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:40,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:40,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 11:29:40,622 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:40,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:40,622 INFO L85 PathProgramCache]: Analyzing trace with hash -896869873, now seen corresponding path program 1 times [2022-07-13 11:29:40,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:40,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097245895] [2022-07-13 11:29:40,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:40,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:40,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:29:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:40,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:40,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:40,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097245895] [2022-07-13 11:29:40,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097245895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:40,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:40,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:29:40,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334406409] [2022-07-13 11:29:40,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:40,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:29:40,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:40,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:29:40,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:40,684 INFO L87 Difference]: Start difference. First operand 301 states and 418 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:29:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:40,926 INFO L93 Difference]: Finished difference Result 569 states and 825 transitions. [2022-07-13 11:29:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:29:40,927 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-07-13 11:29:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:40,931 INFO L225 Difference]: With dead ends: 569 [2022-07-13 11:29:40,931 INFO L226 Difference]: Without dead ends: 326 [2022-07-13 11:29:40,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:29:40,935 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 61 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:40,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1136 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-07-13 11:29:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 313. [2022-07-13 11:29:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 252 states have (on average 1.2936507936507937) internal successors, (326), 257 states have internal predecessors, (326), 44 states have call successors, (44), 15 states have call predecessors, (44), 16 states have return successors, (77), 40 states have call predecessors, (77), 38 states have call successors, (77) [2022-07-13 11:29:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 447 transitions. [2022-07-13 11:29:40,964 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 447 transitions. Word has length 48 [2022-07-13 11:29:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:40,964 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 447 transitions. [2022-07-13 11:29:40,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:29:40,965 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 447 transitions. [2022-07-13 11:29:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:29:40,965 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:40,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:40,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 11:29:40,966 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:40,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:40,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1018197871, now seen corresponding path program 1 times [2022-07-13 11:29:40,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:40,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818422401] [2022-07-13 11:29:40,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:40,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:41,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 11:29:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:41,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:41,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818422401] [2022-07-13 11:29:41,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818422401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:41,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:41,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 11:29:41,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887546352] [2022-07-13 11:29:41,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:41,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:29:41,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:41,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:29:41,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:29:41,064 INFO L87 Difference]: Start difference. First operand 313 states and 447 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:41,386 INFO L93 Difference]: Finished difference Result 315 states and 448 transitions. [2022-07-13 11:29:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:29:41,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-07-13 11:29:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:41,389 INFO L225 Difference]: With dead ends: 315 [2022-07-13 11:29:41,389 INFO L226 Difference]: Without dead ends: 282 [2022-07-13 11:29:41,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:29:41,390 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 66 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:41,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1244 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-13 11:29:41,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-07-13 11:29:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 224 states have (on average 1.3169642857142858) internal successors, (295), 228 states have internal predecessors, (295), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (76), 39 states have call predecessors, (76), 37 states have call successors, (76) [2022-07-13 11:29:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 413 transitions. [2022-07-13 11:29:41,414 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 413 transitions. Word has length 44 [2022-07-13 11:29:41,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:41,415 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 413 transitions. [2022-07-13 11:29:41,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 413 transitions. [2022-07-13 11:29:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 11:29:41,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:41,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:41,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 11:29:41,419 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:41,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1224484534, now seen corresponding path program 1 times [2022-07-13 11:29:41,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:41,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562019479] [2022-07-13 11:29:41,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:41,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:41,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:29:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:41,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:41,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:41,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562019479] [2022-07-13 11:29:41,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562019479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:41,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:41,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:29:41,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017638701] [2022-07-13 11:29:41,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:41,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:29:41,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:41,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:29:41,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:29:41,463 INFO L87 Difference]: Start difference. First operand 282 states and 413 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:29:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:41,657 INFO L93 Difference]: Finished difference Result 441 states and 673 transitions. [2022-07-13 11:29:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:29:41,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-13 11:29:41,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:41,661 INFO L225 Difference]: With dead ends: 441 [2022-07-13 11:29:41,662 INFO L226 Difference]: Without dead ends: 438 [2022-07-13 11:29:41,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:29:41,662 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 140 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:41,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 793 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:41,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-07-13 11:29:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 286. [2022-07-13 11:29:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 228 states have (on average 1.3201754385964912) internal successors, (301), 232 states have internal predecessors, (301), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (76), 39 states have call predecessors, (76), 37 states have call successors, (76) [2022-07-13 11:29:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 419 transitions. [2022-07-13 11:29:41,690 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 419 transitions. Word has length 49 [2022-07-13 11:29:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:41,690 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 419 transitions. [2022-07-13 11:29:41,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:29:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 419 transitions. [2022-07-13 11:29:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 11:29:41,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:41,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:41,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 11:29:41,692 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:41,692 INFO L85 PathProgramCache]: Analyzing trace with hash -2015471348, now seen corresponding path program 1 times [2022-07-13 11:29:41,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:41,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674762129] [2022-07-13 11:29:41,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:41,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:41,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:29:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:41,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:41,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:41,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674762129] [2022-07-13 11:29:41,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674762129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:41,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:41,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:29:41,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493028149] [2022-07-13 11:29:41,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:41,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:29:41,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:41,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:29:41,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:29:41,750 INFO L87 Difference]: Start difference. First operand 286 states and 419 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:29:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:41,960 INFO L93 Difference]: Finished difference Result 658 states and 979 transitions. [2022-07-13 11:29:41,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:29:41,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-13 11:29:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:41,963 INFO L225 Difference]: With dead ends: 658 [2022-07-13 11:29:41,963 INFO L226 Difference]: Without dead ends: 405 [2022-07-13 11:29:41,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:41,968 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 214 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:41,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 543 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-07-13 11:29:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 373. [2022-07-13 11:29:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 297 states have (on average 1.2996632996632997) internal successors, (386), 302 states have internal predecessors, (386), 53 states have call successors, (53), 18 states have call predecessors, (53), 22 states have return successors, (96), 52 states have call predecessors, (96), 49 states have call successors, (96) [2022-07-13 11:29:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 535 transitions. [2022-07-13 11:29:41,998 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 535 transitions. Word has length 49 [2022-07-13 11:29:41,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:41,998 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 535 transitions. [2022-07-13 11:29:41,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:29:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 535 transitions. [2022-07-13 11:29:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 11:29:41,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:41,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:41,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 11:29:42,000 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:42,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:42,000 INFO L85 PathProgramCache]: Analyzing trace with hash -726473774, now seen corresponding path program 1 times [2022-07-13 11:29:42,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:42,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441902906] [2022-07-13 11:29:42,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:42,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:42,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:42,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:42,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:42,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:42,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441902906] [2022-07-13 11:29:42,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441902906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:42,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:42,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 11:29:42,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406032287] [2022-07-13 11:29:42,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:42,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:29:42,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:42,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:29:42,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:29:42,166 INFO L87 Difference]: Start difference. First operand 373 states and 535 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:29:42,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:42,390 INFO L93 Difference]: Finished difference Result 691 states and 1016 transitions. [2022-07-13 11:29:42,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:29:42,391 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-13 11:29:42,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:42,393 INFO L225 Difference]: With dead ends: 691 [2022-07-13 11:29:42,393 INFO L226 Difference]: Without dead ends: 346 [2022-07-13 11:29:42,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:29:42,395 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 88 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:42,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 983 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:42,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-13 11:29:42,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-07-13 11:29:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 271 states have (on average 1.2767527675276753) internal successors, (346), 275 states have internal predecessors, (346), 52 states have call successors, (52), 18 states have call predecessors, (52), 22 states have return successors, (96), 52 states have call predecessors, (96), 49 states have call successors, (96) [2022-07-13 11:29:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 494 transitions. [2022-07-13 11:29:42,423 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 494 transitions. Word has length 50 [2022-07-13 11:29:42,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:42,424 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 494 transitions. [2022-07-13 11:29:42,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:29:42,424 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 494 transitions. [2022-07-13 11:29:42,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 11:29:42,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:42,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:42,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-13 11:29:42,426 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:42,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:42,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1339562411, now seen corresponding path program 1 times [2022-07-13 11:29:42,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:42,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671993937] [2022-07-13 11:29:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:42,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:42,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:42,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:42,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:42,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:42,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671993937] [2022-07-13 11:29:42,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671993937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:42,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:42,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 11:29:42,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576145172] [2022-07-13 11:29:42,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:42,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:29:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:42,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:29:42,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:29:42,564 INFO L87 Difference]: Start difference. First operand 346 states and 494 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:42,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:42,904 INFO L93 Difference]: Finished difference Result 659 states and 959 transitions. [2022-07-13 11:29:42,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:29:42,905 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2022-07-13 11:29:42,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:42,907 INFO L225 Difference]: With dead ends: 659 [2022-07-13 11:29:42,907 INFO L226 Difference]: Without dead ends: 341 [2022-07-13 11:29:42,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:29:42,909 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 232 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:42,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 839 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-13 11:29:42,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-07-13 11:29:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 267 states have (on average 1.2659176029962547) internal successors, (338), 271 states have internal predecessors, (338), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (91), 51 states have call predecessors, (91), 49 states have call successors, (91) [2022-07-13 11:29:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 481 transitions. [2022-07-13 11:29:42,945 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 481 transitions. Word has length 54 [2022-07-13 11:29:42,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:42,945 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 481 transitions. [2022-07-13 11:29:42,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 481 transitions. [2022-07-13 11:29:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 11:29:42,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:42,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:42,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-13 11:29:42,947 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:42,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:42,948 INFO L85 PathProgramCache]: Analyzing trace with hash 330640549, now seen corresponding path program 1 times [2022-07-13 11:29:42,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:42,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399960907] [2022-07-13 11:29:42,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:42,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:42,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:42,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:43,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:43,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:43,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:43,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399960907] [2022-07-13 11:29:43,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399960907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:43,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:43,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:29:43,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098190465] [2022-07-13 11:29:43,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:43,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:29:43,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:43,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:29:43,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:43,024 INFO L87 Difference]: Start difference. First operand 341 states and 481 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:29:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:43,210 INFO L93 Difference]: Finished difference Result 666 states and 963 transitions. [2022-07-13 11:29:43,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:29:43,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-07-13 11:29:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:43,213 INFO L225 Difference]: With dead ends: 666 [2022-07-13 11:29:43,213 INFO L226 Difference]: Without dead ends: 353 [2022-07-13 11:29:43,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:43,216 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 51 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:43,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 686 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-07-13 11:29:43,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 344. [2022-07-13 11:29:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 270 states have (on average 1.262962962962963) internal successors, (341), 274 states have internal predecessors, (341), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (91), 51 states have call predecessors, (91), 49 states have call successors, (91) [2022-07-13 11:29:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 484 transitions. [2022-07-13 11:29:43,269 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 484 transitions. Word has length 57 [2022-07-13 11:29:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:43,270 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 484 transitions. [2022-07-13 11:29:43,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:29:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 484 transitions. [2022-07-13 11:29:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 11:29:43,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:43,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:43,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-13 11:29:43,271 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:43,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:43,272 INFO L85 PathProgramCache]: Analyzing trace with hash 942519397, now seen corresponding path program 1 times [2022-07-13 11:29:43,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:43,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866851368] [2022-07-13 11:29:43,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:43,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:43,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:43,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:43,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:43,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:43,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:43,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866851368] [2022-07-13 11:29:43,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866851368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:43,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:43,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 11:29:43,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050483858] [2022-07-13 11:29:43,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:43,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:29:43,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:43,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:29:43,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:29:43,382 INFO L87 Difference]: Start difference. First operand 344 states and 484 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:29:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:43,690 INFO L93 Difference]: Finished difference Result 662 states and 947 transitions. [2022-07-13 11:29:43,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:29:43,691 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-07-13 11:29:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:43,693 INFO L225 Difference]: With dead ends: 662 [2022-07-13 11:29:43,693 INFO L226 Difference]: Without dead ends: 347 [2022-07-13 11:29:43,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:29:43,695 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 46 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:43,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1287 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:43,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-13 11:29:43,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2022-07-13 11:29:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 270 states have (on average 1.2518518518518518) internal successors, (338), 274 states have internal predecessors, (338), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (91), 51 states have call predecessors, (91), 49 states have call successors, (91) [2022-07-13 11:29:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2022-07-13 11:29:43,732 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 57 [2022-07-13 11:29:43,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:43,732 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2022-07-13 11:29:43,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:29:43,733 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2022-07-13 11:29:43,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-13 11:29:43,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:43,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:43,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-13 11:29:43,735 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:43,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:43,735 INFO L85 PathProgramCache]: Analyzing trace with hash -146309345, now seen corresponding path program 1 times [2022-07-13 11:29:43,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:43,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482053694] [2022-07-13 11:29:43,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:43,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:43,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:43,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:43,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:43,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:43,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 11:29:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:43,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:43,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482053694] [2022-07-13 11:29:43,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482053694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:43,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:43,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 11:29:43,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547801648] [2022-07-13 11:29:43,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:43,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:29:43,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:43,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:29:43,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:29:43,833 INFO L87 Difference]: Start difference. First operand 344 states and 481 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 11:29:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:44,250 INFO L93 Difference]: Finished difference Result 623 states and 870 transitions. [2022-07-13 11:29:44,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:29:44,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-07-13 11:29:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:44,253 INFO L225 Difference]: With dead ends: 623 [2022-07-13 11:29:44,253 INFO L226 Difference]: Without dead ends: 322 [2022-07-13 11:29:44,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:29:44,255 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 165 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:44,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1228 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:44,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-07-13 11:29:44,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 314. [2022-07-13 11:29:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 246 states have (on average 1.2560975609756098) internal successors, (309), 252 states have internal predecessors, (309), 49 states have call successors, (49), 18 states have call predecessors, (49), 18 states have return successors, (70), 43 states have call predecessors, (70), 46 states have call successors, (70) [2022-07-13 11:29:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 428 transitions. [2022-07-13 11:29:44,289 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 428 transitions. Word has length 68 [2022-07-13 11:29:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:44,289 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 428 transitions. [2022-07-13 11:29:44,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 11:29:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 428 transitions. [2022-07-13 11:29:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-13 11:29:44,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:44,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:44,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-13 11:29:44,291 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:44,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:44,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1989043251, now seen corresponding path program 1 times [2022-07-13 11:29:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:44,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357472909] [2022-07-13 11:29:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:44,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:44,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:44,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:44,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:44,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 11:29:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:44,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:44,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357472909] [2022-07-13 11:29:44,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357472909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:44,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:44,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-13 11:29:44,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539160951] [2022-07-13 11:29:44,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:44,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:29:44,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:44,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:29:44,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:29:44,458 INFO L87 Difference]: Start difference. First operand 314 states and 428 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 11:29:44,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:44,949 INFO L93 Difference]: Finished difference Result 350 states and 477 transitions. [2022-07-13 11:29:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 11:29:44,950 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2022-07-13 11:29:44,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:44,952 INFO L225 Difference]: With dead ends: 350 [2022-07-13 11:29:44,952 INFO L226 Difference]: Without dead ends: 329 [2022-07-13 11:29:44,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:29:44,953 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 126 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:44,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 2065 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:29:44,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-13 11:29:44,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 317. [2022-07-13 11:29:44,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 248 states have (on average 1.2540322580645162) internal successors, (311), 255 states have internal predecessors, (311), 49 states have call successors, (49), 18 states have call predecessors, (49), 19 states have return successors, (71), 43 states have call predecessors, (71), 46 states have call successors, (71) [2022-07-13 11:29:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2022-07-13 11:29:44,979 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 73 [2022-07-13 11:29:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:44,979 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2022-07-13 11:29:44,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 11:29:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2022-07-13 11:29:44,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-13 11:29:44,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:44,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:44,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-13 11:29:44,981 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:44,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:44,981 INFO L85 PathProgramCache]: Analyzing trace with hash -182846632, now seen corresponding path program 1 times [2022-07-13 11:29:44,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:44,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806901898] [2022-07-13 11:29:44,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:44,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:45,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:45,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:45,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:45,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:45,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 11:29:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:45,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:45,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806901898] [2022-07-13 11:29:45,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806901898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:45,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:45,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-13 11:29:45,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558944979] [2022-07-13 11:29:45,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:45,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:29:45,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:45,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:29:45,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:29:45,167 INFO L87 Difference]: Start difference. First operand 317 states and 431 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 11:29:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:45,691 INFO L93 Difference]: Finished difference Result 354 states and 481 transitions. [2022-07-13 11:29:45,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 11:29:45,691 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2022-07-13 11:29:45,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:45,693 INFO L225 Difference]: With dead ends: 354 [2022-07-13 11:29:45,694 INFO L226 Difference]: Without dead ends: 333 [2022-07-13 11:29:45,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:29:45,695 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 126 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:45,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 2379 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:29:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-13 11:29:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 317. [2022-07-13 11:29:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 248 states have (on average 1.2540322580645162) internal successors, (311), 255 states have internal predecessors, (311), 49 states have call successors, (49), 18 states have call predecessors, (49), 19 states have return successors, (71), 43 states have call predecessors, (71), 46 states have call successors, (71) [2022-07-13 11:29:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2022-07-13 11:29:45,726 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 74 [2022-07-13 11:29:45,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:45,726 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2022-07-13 11:29:45,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 11:29:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2022-07-13 11:29:45,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-13 11:29:45,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:45,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:45,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-13 11:29:45,728 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:45,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:45,728 INFO L85 PathProgramCache]: Analyzing trace with hash -673237615, now seen corresponding path program 1 times [2022-07-13 11:29:45,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:45,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800811943] [2022-07-13 11:29:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 11:29:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:45,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:45,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:45,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:45,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 11:29:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:45,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 11:29:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:45,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:45,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:45,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800811943] [2022-07-13 11:29:45,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800811943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:45,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:45,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-13 11:29:45,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769989356] [2022-07-13 11:29:45,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:45,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 11:29:45,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:45,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 11:29:45,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:29:45,925 INFO L87 Difference]: Start difference. First operand 317 states and 431 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 11:29:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:46,813 INFO L93 Difference]: Finished difference Result 468 states and 698 transitions. [2022-07-13 11:29:46,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 11:29:46,813 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 82 [2022-07-13 11:29:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:46,816 INFO L225 Difference]: With dead ends: 468 [2022-07-13 11:29:46,816 INFO L226 Difference]: Without dead ends: 429 [2022-07-13 11:29:46,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-07-13 11:29:46,817 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 194 mSDsluCounter, 2445 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2688 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:46,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 2688 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:29:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-07-13 11:29:46,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 413. [2022-07-13 11:29:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 316 states have (on average 1.2626582278481013) internal successors, (399), 327 states have internal predecessors, (399), 76 states have call successors, (76), 18 states have call predecessors, (76), 20 states have return successors, (110), 67 states have call predecessors, (110), 72 states have call successors, (110) [2022-07-13 11:29:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 585 transitions. [2022-07-13 11:29:46,851 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 585 transitions. Word has length 82 [2022-07-13 11:29:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:46,851 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 585 transitions. [2022-07-13 11:29:46,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 11:29:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 585 transitions. [2022-07-13 11:29:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 11:29:46,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:46,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:46,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-13 11:29:46,853 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:46,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:46,853 INFO L85 PathProgramCache]: Analyzing trace with hash -166689667, now seen corresponding path program 1 times [2022-07-13 11:29:46,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:46,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564805296] [2022-07-13 11:29:46,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:46,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:46,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:46,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:46,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:46,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:46,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 11:29:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:46,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 11:29:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:46,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:46,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564805296] [2022-07-13 11:29:46,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564805296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:46,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:46,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:29:46,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941579640] [2022-07-13 11:29:46,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:46,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:29:46,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:46,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:29:46,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:29:46,959 INFO L87 Difference]: Start difference. First operand 413 states and 585 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 11:29:47,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:47,400 INFO L93 Difference]: Finished difference Result 809 states and 1103 transitions. [2022-07-13 11:29:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:29:47,400 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 84 [2022-07-13 11:29:47,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:47,404 INFO L225 Difference]: With dead ends: 809 [2022-07-13 11:29:47,404 INFO L226 Difference]: Without dead ends: 538 [2022-07-13 11:29:47,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:29:47,406 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 377 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:47,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1031 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:47,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-07-13 11:29:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 496. [2022-07-13 11:29:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.2532299741602067) internal successors, (485), 397 states have internal predecessors, (485), 79 states have call successors, (79), 25 states have call predecessors, (79), 29 states have return successors, (114), 73 states have call predecessors, (114), 75 states have call successors, (114) [2022-07-13 11:29:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 678 transitions. [2022-07-13 11:29:47,447 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 678 transitions. Word has length 84 [2022-07-13 11:29:47,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:47,447 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 678 transitions. [2022-07-13 11:29:47,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 11:29:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 678 transitions. [2022-07-13 11:29:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 11:29:47,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:47,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:47,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-13 11:29:47,449 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:47,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:47,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1602435204, now seen corresponding path program 1 times [2022-07-13 11:29:47,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:47,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391800684] [2022-07-13 11:29:47,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:47,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:47,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:47,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:47,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:47,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:47,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 11:29:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:47,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 11:29:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:47,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:47,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391800684] [2022-07-13 11:29:47,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391800684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:47,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:47,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:29:47,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684666303] [2022-07-13 11:29:47,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:47,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:29:47,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:47,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:29:47,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:29:47,573 INFO L87 Difference]: Start difference. First operand 496 states and 678 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 11:29:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:48,072 INFO L93 Difference]: Finished difference Result 867 states and 1198 transitions. [2022-07-13 11:29:48,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:29:48,072 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 84 [2022-07-13 11:29:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:48,075 INFO L225 Difference]: With dead ends: 867 [2022-07-13 11:29:48,075 INFO L226 Difference]: Without dead ends: 496 [2022-07-13 11:29:48,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:29:48,077 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 447 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:48,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 712 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:48,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-07-13 11:29:48,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2022-07-13 11:29:48,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.248062015503876) internal successors, (483), 397 states have internal predecessors, (483), 79 states have call successors, (79), 25 states have call predecessors, (79), 29 states have return successors, (106), 73 states have call predecessors, (106), 75 states have call successors, (106) [2022-07-13 11:29:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 668 transitions. [2022-07-13 11:29:48,117 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 668 transitions. Word has length 84 [2022-07-13 11:29:48,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:48,118 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 668 transitions. [2022-07-13 11:29:48,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-13 11:29:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 668 transitions. [2022-07-13 11:29:48,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-13 11:29:48,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:48,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:48,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-13 11:29:48,120 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:48,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:48,120 INFO L85 PathProgramCache]: Analyzing trace with hash 716383564, now seen corresponding path program 1 times [2022-07-13 11:29:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:48,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978378886] [2022-07-13 11:29:48,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:48,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:48,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 11:29:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:48,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:48,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:48,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:48,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 11:29:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:48,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 11:29:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:48,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:48,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978378886] [2022-07-13 11:29:48,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978378886] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:48,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:48,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-13 11:29:48,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690492215] [2022-07-13 11:29:48,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:48,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 11:29:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:48,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 11:29:48,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:29:48,318 INFO L87 Difference]: Start difference. First operand 496 states and 668 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 11:29:49,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:49,119 INFO L93 Difference]: Finished difference Result 657 states and 955 transitions. [2022-07-13 11:29:49,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 11:29:49,119 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 83 [2022-07-13 11:29:49,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:49,123 INFO L225 Difference]: With dead ends: 657 [2022-07-13 11:29:49,123 INFO L226 Difference]: Without dead ends: 610 [2022-07-13 11:29:49,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-07-13 11:29:49,125 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 249 mSDsluCounter, 2094 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 2335 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:49,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 2335 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:29:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-07-13 11:29:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 493. [2022-07-13 11:29:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 385 states have (on average 1.2493506493506494) internal successors, (481), 394 states have internal predecessors, (481), 79 states have call successors, (79), 25 states have call predecessors, (79), 28 states have return successors, (105), 73 states have call predecessors, (105), 75 states have call successors, (105) [2022-07-13 11:29:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 665 transitions. [2022-07-13 11:29:49,165 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 665 transitions. Word has length 83 [2022-07-13 11:29:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:49,166 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 665 transitions. [2022-07-13 11:29:49,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 11:29:49,166 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 665 transitions. [2022-07-13 11:29:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 11:29:49,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:49,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:49,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-13 11:29:49,168 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:49,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:49,168 INFO L85 PathProgramCache]: Analyzing trace with hash 971177342, now seen corresponding path program 1 times [2022-07-13 11:29:49,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:49,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195214203] [2022-07-13 11:29:49,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:49,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:49,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:49,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:49,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:49,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:49,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 11:29:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:49,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 11:29:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:49,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:49,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195214203] [2022-07-13 11:29:49,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195214203] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:49,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:49,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-13 11:29:49,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232390404] [2022-07-13 11:29:49,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:49,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 11:29:49,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:49,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 11:29:49,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:29:49,337 INFO L87 Difference]: Start difference. First operand 493 states and 665 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 11:29:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:50,067 INFO L93 Difference]: Finished difference Result 957 states and 1298 transitions. [2022-07-13 11:29:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 11:29:50,067 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2022-07-13 11:29:50,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:50,072 INFO L225 Difference]: With dead ends: 957 [2022-07-13 11:29:50,072 INFO L226 Difference]: Without dead ends: 931 [2022-07-13 11:29:50,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2022-07-13 11:29:50,073 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 348 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:50,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 2112 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:29:50,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-07-13 11:29:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 585. [2022-07-13 11:29:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 461 states have (on average 1.2190889370932756) internal successors, (562), 473 states have internal predecessors, (562), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (115), 80 states have call predecessors, (115), 81 states have call successors, (115) [2022-07-13 11:29:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 762 transitions. [2022-07-13 11:29:50,131 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 762 transitions. Word has length 84 [2022-07-13 11:29:50,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:50,132 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 762 transitions. [2022-07-13 11:29:50,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 11:29:50,132 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 762 transitions. [2022-07-13 11:29:50,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 11:29:50,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:50,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:50,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-13 11:29:50,133 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:50,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:50,134 INFO L85 PathProgramCache]: Analyzing trace with hash -171325124, now seen corresponding path program 1 times [2022-07-13 11:29:50,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:50,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228644377] [2022-07-13 11:29:50,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:50,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:50,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:50,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:50,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:50,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:50,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 11:29:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:50,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 11:29:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:50,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:50,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228644377] [2022-07-13 11:29:50,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228644377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:50,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:50,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-13 11:29:50,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810796790] [2022-07-13 11:29:50,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:50,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 11:29:50,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:50,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 11:29:50,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:29:50,296 INFO L87 Difference]: Start difference. First operand 585 states and 762 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 11:29:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:51,033 INFO L93 Difference]: Finished difference Result 952 states and 1287 transitions. [2022-07-13 11:29:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 11:29:51,033 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2022-07-13 11:29:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:51,038 INFO L225 Difference]: With dead ends: 952 [2022-07-13 11:29:51,038 INFO L226 Difference]: Without dead ends: 918 [2022-07-13 11:29:51,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2022-07-13 11:29:51,039 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 273 mSDsluCounter, 2854 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 3201 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:51,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 3201 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:29:51,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-07-13 11:29:51,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 468. [2022-07-13 11:29:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 366 states have (on average 1.2486338797814207) internal successors, (457), 375 states have internal predecessors, (457), 75 states have call successors, (75), 23 states have call predecessors, (75), 26 states have return successors, (100), 69 states have call predecessors, (100), 71 states have call successors, (100) [2022-07-13 11:29:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 632 transitions. [2022-07-13 11:29:51,095 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 632 transitions. Word has length 84 [2022-07-13 11:29:51,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:51,095 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 632 transitions. [2022-07-13 11:29:51,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 11:29:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 632 transitions. [2022-07-13 11:29:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-13 11:29:51,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:51,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:51,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-13 11:29:51,097 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:51,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1715684878, now seen corresponding path program 1 times [2022-07-13 11:29:51,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:51,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138999040] [2022-07-13 11:29:51,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:51,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:51,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 11:29:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:51,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:51,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:51,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:51,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 11:29:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:51,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 11:29:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:51,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 11:29:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:51,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:51,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138999040] [2022-07-13 11:29:51,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138999040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:51,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:51,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-13 11:29:51,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466477976] [2022-07-13 11:29:51,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:51,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:29:51,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:51,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:29:51,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:29:51,278 INFO L87 Difference]: Start difference. First operand 468 states and 632 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 11:29:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:52,191 INFO L93 Difference]: Finished difference Result 932 states and 1258 transitions. [2022-07-13 11:29:52,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 11:29:52,192 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2022-07-13 11:29:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:52,195 INFO L225 Difference]: With dead ends: 932 [2022-07-13 11:29:52,195 INFO L226 Difference]: Without dead ends: 885 [2022-07-13 11:29:52,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 11:29:52,196 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 531 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:52,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 2123 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:29:52,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-07-13 11:29:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 858. [2022-07-13 11:29:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 666 states have (on average 1.2147147147147148) internal successors, (809), 684 states have internal predecessors, (809), 142 states have call successors, (142), 43 states have call predecessors, (142), 49 states have return successors, (185), 130 states have call predecessors, (185), 137 states have call successors, (185) [2022-07-13 11:29:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1136 transitions. [2022-07-13 11:29:52,295 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1136 transitions. Word has length 93 [2022-07-13 11:29:52,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:52,297 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 1136 transitions. [2022-07-13 11:29:52,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 11:29:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1136 transitions. [2022-07-13 11:29:52,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 11:29:52,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:52,304 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:52,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-13 11:29:52,305 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:52,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:52,305 INFO L85 PathProgramCache]: Analyzing trace with hash 327002288, now seen corresponding path program 1 times [2022-07-13 11:29:52,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:52,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224653133] [2022-07-13 11:29:52,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:52,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:52,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 11:29:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:52,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:52,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:52,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 11:29:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:52,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 11:29:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:52,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:52,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 11:29:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:52,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224653133] [2022-07-13 11:29:52,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224653133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:52,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:52,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:29:52,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285163245] [2022-07-13 11:29:52,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:52,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:29:52,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:52,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:29:52,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:29:52,435 INFO L87 Difference]: Start difference. First operand 858 states and 1136 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 11:29:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:52,931 INFO L93 Difference]: Finished difference Result 1692 states and 2335 transitions. [2022-07-13 11:29:52,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:29:52,931 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 95 [2022-07-13 11:29:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:52,936 INFO L225 Difference]: With dead ends: 1692 [2022-07-13 11:29:52,937 INFO L226 Difference]: Without dead ends: 1142 [2022-07-13 11:29:52,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:29:52,940 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 158 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:52,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1354 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:29:52,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-07-13 11:29:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 834. [2022-07-13 11:29:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 650 states have (on average 1.1953846153846155) internal successors, (777), 664 states have internal predecessors, (777), 134 states have call successors, (134), 43 states have call predecessors, (134), 49 states have return successors, (173), 126 states have call predecessors, (173), 129 states have call successors, (173) [2022-07-13 11:29:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1084 transitions. [2022-07-13 11:29:53,052 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1084 transitions. Word has length 95 [2022-07-13 11:29:53,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:53,053 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1084 transitions. [2022-07-13 11:29:53,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 11:29:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1084 transitions. [2022-07-13 11:29:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-13 11:29:53,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:53,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:53,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-13 11:29:53,056 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1808548852, now seen corresponding path program 1 times [2022-07-13 11:29:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:53,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738551419] [2022-07-13 11:29:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:53,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 11:29:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:53,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:53,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:53,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:53,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 11:29:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:53,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 11:29:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:53,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 11:29:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:53,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:53,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738551419] [2022-07-13 11:29:53,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738551419] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:53,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:53,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-13 11:29:53,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204346692] [2022-07-13 11:29:53,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:53,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:29:53,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:53,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:29:53,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:29:53,258 INFO L87 Difference]: Start difference. First operand 834 states and 1084 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 11:29:54,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:54,353 INFO L93 Difference]: Finished difference Result 858 states and 1116 transitions. [2022-07-13 11:29:54,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 11:29:54,353 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2022-07-13 11:29:54,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:54,357 INFO L225 Difference]: With dead ends: 858 [2022-07-13 11:29:54,357 INFO L226 Difference]: Without dead ends: 809 [2022-07-13 11:29:54,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 11:29:54,358 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 363 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:54,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 3028 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:29:54,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-13 11:29:54,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 306. [2022-07-13 11:29:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 242 states have (on average 1.1363636363636365) internal successors, (275), 247 states have internal predecessors, (275), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (48), 37 states have call predecessors, (48), 38 states have call successors, (48) [2022-07-13 11:29:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 364 transitions. [2022-07-13 11:29:54,401 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 364 transitions. Word has length 93 [2022-07-13 11:29:54,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:54,401 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 364 transitions. [2022-07-13 11:29:54,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 11:29:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 364 transitions. [2022-07-13 11:29:54,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-13 11:29:54,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:54,403 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:54,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-13 11:29:54,403 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:54,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:54,404 INFO L85 PathProgramCache]: Analyzing trace with hash 46403579, now seen corresponding path program 1 times [2022-07-13 11:29:54,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:54,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398331939] [2022-07-13 11:29:54,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:54,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:54,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 11:29:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:54,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:54,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:54,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:54,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 11:29:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:54,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 11:29:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:54,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:54,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:54,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 11:29:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:54,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 11:29:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:54,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:54,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-13 11:29:54,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:54,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398331939] [2022-07-13 11:29:54,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398331939] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:29:54,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791431179] [2022-07-13 11:29:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:54,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:29:54,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:29:54,523 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-13 11:29:54,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:29:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:54,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:29:54,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 11:29:54,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:29:54,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791431179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:54,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:29:54,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-07-13 11:29:54,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018337985] [2022-07-13 11:29:54,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:54,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:29:54,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:54,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:29:54,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:29:54,842 INFO L87 Difference]: Start difference. First operand 306 states and 364 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 11:29:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:54,969 INFO L93 Difference]: Finished difference Result 513 states and 620 transitions. [2022-07-13 11:29:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:29:54,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 133 [2022-07-13 11:29:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:54,971 INFO L225 Difference]: With dead ends: 513 [2022-07-13 11:29:54,972 INFO L226 Difference]: Without dead ends: 327 [2022-07-13 11:29:54,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:29:54,973 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:54,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 715 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:29:54,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-07-13 11:29:55,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 322. [2022-07-13 11:29:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 256 states have (on average 1.12890625) internal successors, (289), 262 states have internal predecessors, (289), 41 states have call successors, (41), 21 states have call predecessors, (41), 24 states have return successors, (55), 38 states have call predecessors, (55), 38 states have call successors, (55) [2022-07-13 11:29:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 385 transitions. [2022-07-13 11:29:55,014 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 385 transitions. Word has length 133 [2022-07-13 11:29:55,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:55,014 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 385 transitions. [2022-07-13 11:29:55,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 11:29:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 385 transitions. [2022-07-13 11:29:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-13 11:29:55,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:55,016 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:55,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:29:55,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-07-13 11:29:55,235 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:55,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:55,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1067504510, now seen corresponding path program 1 times [2022-07-13 11:29:55,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:55,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325506281] [2022-07-13 11:29:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:55,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 11:29:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 11:29:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 11:29:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 11:29:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 11:29:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-13 11:29:55,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:55,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325506281] [2022-07-13 11:29:55,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325506281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:55,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:55,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:29:55,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122650168] [2022-07-13 11:29:55,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:55,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:29:55,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:55,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:29:55,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:29:55,365 INFO L87 Difference]: Start difference. First operand 322 states and 385 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-13 11:29:55,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:55,821 INFO L93 Difference]: Finished difference Result 534 states and 639 transitions. [2022-07-13 11:29:55,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:29:55,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 134 [2022-07-13 11:29:55,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:55,823 INFO L225 Difference]: With dead ends: 534 [2022-07-13 11:29:55,823 INFO L226 Difference]: Without dead ends: 362 [2022-07-13 11:29:55,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:29:55,825 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 118 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:55,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1066 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:29:55,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-13 11:29:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 315. [2022-07-13 11:29:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 251 states have (on average 1.1155378486055776) internal successors, (280), 256 states have internal predecessors, (280), 39 states have call successors, (39), 21 states have call predecessors, (39), 24 states have return successors, (51), 37 states have call predecessors, (51), 36 states have call successors, (51) [2022-07-13 11:29:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 370 transitions. [2022-07-13 11:29:55,863 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 370 transitions. Word has length 134 [2022-07-13 11:29:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:55,864 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 370 transitions. [2022-07-13 11:29:55,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-13 11:29:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 370 transitions. [2022-07-13 11:29:55,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-13 11:29:55,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:55,866 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:55,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-13 11:29:55,866 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:55,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1031777441, now seen corresponding path program 1 times [2022-07-13 11:29:55,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:55,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28528959] [2022-07-13 11:29:55,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:55,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 11:29:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 11:29:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 11:29:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 11:29:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 11:29:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 11:29:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:55,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 11:29:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-13 11:29:56,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:56,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28528959] [2022-07-13 11:29:56,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28528959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:56,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:56,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:29:56,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092705605] [2022-07-13 11:29:56,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:56,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:29:56,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:56,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:29:56,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:29:56,011 INFO L87 Difference]: Start difference. First operand 315 states and 370 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 11:29:56,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:56,414 INFO L93 Difference]: Finished difference Result 384 states and 451 transitions. [2022-07-13 11:29:56,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:29:56,414 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 170 [2022-07-13 11:29:56,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:56,416 INFO L225 Difference]: With dead ends: 384 [2022-07-13 11:29:56,416 INFO L226 Difference]: Without dead ends: 317 [2022-07-13 11:29:56,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:29:56,417 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 98 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:56,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 909 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-13 11:29:56,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 217. [2022-07-13 11:29:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 176 states have (on average 1.1136363636363635) internal successors, (196), 178 states have internal predecessors, (196), 24 states have call successors, (24), 14 states have call predecessors, (24), 16 states have return successors, (30), 24 states have call predecessors, (30), 22 states have call successors, (30) [2022-07-13 11:29:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 250 transitions. [2022-07-13 11:29:56,447 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 250 transitions. Word has length 170 [2022-07-13 11:29:56,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:56,447 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 250 transitions. [2022-07-13 11:29:56,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 11:29:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 250 transitions. [2022-07-13 11:29:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-13 11:29:56,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:56,449 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:56,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-07-13 11:29:56,449 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:56,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:56,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1337713774, now seen corresponding path program 1 times [2022-07-13 11:29:56,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:56,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201088070] [2022-07-13 11:29:56,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:56,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 11:29:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 11:29:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 11:29:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 11:29:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 11:29:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 11:29:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 11:29:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 11:29:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-13 11:29:56,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:56,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201088070] [2022-07-13 11:29:56,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201088070] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:56,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:56,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:29:56,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286882448] [2022-07-13 11:29:56,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:56,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:29:56,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:56,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:29:56,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:29:56,593 INFO L87 Difference]: Start difference. First operand 217 states and 250 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 11:29:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:56,930 INFO L93 Difference]: Finished difference Result 223 states and 259 transitions. [2022-07-13 11:29:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:29:56,931 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 173 [2022-07-13 11:29:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:56,931 INFO L225 Difference]: With dead ends: 223 [2022-07-13 11:29:56,931 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 11:29:56,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:29:56,932 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 72 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:56,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 713 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:56,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 11:29:56,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 11:29:56,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:29:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 11:29:56,933 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2022-07-13 11:29:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:56,934 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 11:29:56,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 11:29:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 11:29:56,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 11:29:56,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:29:56,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-07-13 11:29:56,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 11:30:22,689 WARN L233 SmtUtils]: Spent 10.76s on a formula simplification. DAG size of input: 122 DAG size of output: 120 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-13 11:30:34,232 WARN L233 SmtUtils]: Spent 5.75s on a formula simplification. DAG size of input: 121 DAG size of output: 119 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-13 11:30:39,978 WARN L233 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 121 DAG size of output: 119 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-13 11:30:49,170 WARN L233 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 121 DAG size of output: 119 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-13 11:32:08,645 WARN L233 SmtUtils]: Spent 1.25m on a formula simplification. DAG size of input: 119 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-13 11:33:24,016 WARN L233 SmtUtils]: Spent 1.26m on a formula simplification. DAG size of input: 119 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)