./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP --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 310044b99b6a4c9305f92a655bab82629ffb49bf202c9a3228cdf9c518cca452 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:08:48,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:08:49,074 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:08:49,086 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:08:49,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:08:49,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:08:49,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:08:49,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:08:49,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:08:49,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:08:49,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:08:49,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:08:49,154 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:08:49,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:08:49,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:08:49,156 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:08:49,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:08:49,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:08:49,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:08:49,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:08:49,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:08:49,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:08:49,159 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:08:49,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:08:49,161 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:08:49,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:08:49,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:08:49,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:08:49,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:08:49,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:08:49,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:08:49,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:08:49,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:08:49,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:08:49,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:08:49,166 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:08:49,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:08:49,166 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:08:49,167 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:08:49,167 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP 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 -> 310044b99b6a4c9305f92a655bab82629ffb49bf202c9a3228cdf9c518cca452 [2023-11-06 22:08:49,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:08:49,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:08:49,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:08:49,546 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:08:49,546 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:08:49,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i [2023-11-06 22:08:52,661 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:08:53,007 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:08:53,008 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i [2023-11-06 22:08:53,016 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/data/515fa8336/5d95618dd7c74eefb1b53616bc5c2775/FLAG0f06131b8 [2023-11-06 22:08:53,030 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/data/515fa8336/5d95618dd7c74eefb1b53616bc5c2775 [2023-11-06 22:08:53,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:08:53,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:08:53,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:08:53,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:08:53,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:08:53,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5153feea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53, skipping insertion in model container [2023-11-06 22:08:53,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,081 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:08:53,234 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i[919,932] [2023-11-06 22:08:53,307 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:08:53,322 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:08:53,338 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i[919,932] [2023-11-06 22:08:53,379 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:08:53,399 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:08:53,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53 WrapperNode [2023-11-06 22:08:53,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:08:53,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:08:53,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:08:53,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:08:53,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,463 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2023-11-06 22:08:53,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:08:53,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:08:53,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:08:53,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:08:53,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,497 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:08:53,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:08:53,512 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:08:53,512 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:08:53,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (1/1) ... [2023-11-06 22:08:53,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:08:53,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:53,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:08:53,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:08:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:08:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:08:53,630 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:08:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:08:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:08:53,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:08:53,748 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:08:53,750 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:08:54,289 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:08:54,297 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:08:54,298 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:08:54,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:08:54 BoogieIcfgContainer [2023-11-06 22:08:54,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:08:54,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:08:54,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:08:54,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:08:54,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:08:53" (1/3) ... [2023-11-06 22:08:54,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c516ff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:08:54, skipping insertion in model container [2023-11-06 22:08:54,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:53" (2/3) ... [2023-11-06 22:08:54,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c516ff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:08:54, skipping insertion in model container [2023-11-06 22:08:54,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:08:54" (3/3) ... [2023-11-06 22:08:54,310 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i [2023-11-06 22:08:54,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:08:54,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:08:54,407 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:08:54,415 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59c769b4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:08:54,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:08:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:08:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-11-06 22:08:54,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:54,440 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:54,441 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:54,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash 742249180, now seen corresponding path program 1 times [2023-11-06 22:08:54,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:54,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287732343] [2023-11-06 22:08:54,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:54,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:08:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:08:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:08:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:08:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:08:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:08:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:08:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:08:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:08:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:08:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:54,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:08:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:08:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:08:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:08:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:08:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 22:08:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:08:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-06 22:08:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-06 22:08:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 22:08:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-06 22:08:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-06 22:08:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-11-06 22:08:55,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:55,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287732343] [2023-11-06 22:08:55,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287732343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:55,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:55,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:08:55,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275930639] [2023-11-06 22:08:55,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:55,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:08:55,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:55,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:08:55,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:08:55,188 INFO L87 Difference]: Start difference. First operand has 91 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2023-11-06 22:08:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:55,260 INFO L93 Difference]: Finished difference Result 175 states and 313 transitions. [2023-11-06 22:08:55,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:08:55,263 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2023-11-06 22:08:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:55,273 INFO L225 Difference]: With dead ends: 175 [2023-11-06 22:08:55,273 INFO L226 Difference]: Without dead ends: 87 [2023-11-06 22:08:55,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:08:55,283 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:55,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-06 22:08:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-06 22:08:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:08:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 138 transitions. [2023-11-06 22:08:55,370 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 138 transitions. Word has length 174 [2023-11-06 22:08:55,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:55,371 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 138 transitions. [2023-11-06 22:08:55,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2023-11-06 22:08:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 138 transitions. [2023-11-06 22:08:55,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-11-06 22:08:55,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:55,382 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:55,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:08:55,383 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:55,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:55,384 INFO L85 PathProgramCache]: Analyzing trace with hash 786031524, now seen corresponding path program 1 times [2023-11-06 22:08:55,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:55,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796531354] [2023-11-06 22:08:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:55,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:08:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:08:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:08:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:08:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:08:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:08:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:08:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:08:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:08:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:08:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:08:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:08:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:08:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:08:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:08:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 22:08:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:08:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-06 22:08:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-06 22:08:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 22:08:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-06 22:08:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-06 22:08:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-11-06 22:08:55,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:55,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796531354] [2023-11-06 22:08:55,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796531354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:55,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:55,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:08:55,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46629624] [2023-11-06 22:08:55,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:55,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:08:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:55,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:08:55,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:08:55,906 INFO L87 Difference]: Start difference. First operand 87 states and 138 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-06 22:08:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:56,019 INFO L93 Difference]: Finished difference Result 252 states and 402 transitions. [2023-11-06 22:08:56,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:08:56,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2023-11-06 22:08:56,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:56,032 INFO L225 Difference]: With dead ends: 252 [2023-11-06 22:08:56,032 INFO L226 Difference]: Without dead ends: 168 [2023-11-06 22:08:56,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:08:56,036 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 118 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:56,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:56,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-06 22:08:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 101. [2023-11-06 22:08:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 72 states have internal predecessors, (107), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:08:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 161 transitions. [2023-11-06 22:08:56,079 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 161 transitions. Word has length 174 [2023-11-06 22:08:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:56,081 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 161 transitions. [2023-11-06 22:08:56,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-06 22:08:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 161 transitions. [2023-11-06 22:08:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-11-06 22:08:56,084 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:56,085 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:56,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:08:56,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:56,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:56,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1733928410, now seen corresponding path program 1 times [2023-11-06 22:08:56,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:56,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475688903] [2023-11-06 22:08:56,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:56,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:08:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:08:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:08:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:08:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:08:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:08:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:08:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:08:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:08:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:08:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:08:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:08:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:08:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:08:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:08:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 22:08:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:08:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-06 22:08:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-06 22:08:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 22:08:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-06 22:08:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-06 22:08:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-11-06 22:08:57,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:57,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475688903] [2023-11-06 22:08:57,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475688903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:57,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:57,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:08:57,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935051367] [2023-11-06 22:08:57,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:57,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:08:57,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:57,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:08:57,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:57,153 INFO L87 Difference]: Start difference. First operand 101 states and 161 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-06 22:08:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:57,264 INFO L93 Difference]: Finished difference Result 225 states and 361 transitions. [2023-11-06 22:08:57,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:08:57,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2023-11-06 22:08:57,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:57,268 INFO L225 Difference]: With dead ends: 225 [2023-11-06 22:08:57,268 INFO L226 Difference]: Without dead ends: 127 [2023-11-06 22:08:57,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:57,271 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 146 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:57,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 353 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-06 22:08:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 101. [2023-11-06 22:08:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 72 states have internal predecessors, (106), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-06 22:08:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 160 transitions. [2023-11-06 22:08:57,286 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 160 transitions. Word has length 174 [2023-11-06 22:08:57,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:57,287 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 160 transitions. [2023-11-06 22:08:57,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-06 22:08:57,288 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 160 transitions. [2023-11-06 22:08:57,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-11-06 22:08:57,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:57,291 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:57,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:08:57,291 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:57,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1974232872, now seen corresponding path program 1 times [2023-11-06 22:08:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:57,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115725289] [2023-11-06 22:08:57,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:57,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:08:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:08:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:08:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:08:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:08:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:08:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:08:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:08:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:08:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:08:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:08:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:08:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:08:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:08:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:08:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 22:08:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:08:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-06 22:08:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-06 22:08:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 22:08:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-06 22:08:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-06 22:08:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-11-06 22:08:57,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:57,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115725289] [2023-11-06 22:08:57,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115725289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:57,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:57,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:08:57,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568104591] [2023-11-06 22:08:57,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:57,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:08:57,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:57,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:08:57,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:57,846 INFO L87 Difference]: Start difference. First operand 101 states and 160 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-06 22:08:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:58,131 INFO L93 Difference]: Finished difference Result 298 states and 475 transitions. [2023-11-06 22:08:58,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:08:58,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2023-11-06 22:08:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:58,136 INFO L225 Difference]: With dead ends: 298 [2023-11-06 22:08:58,136 INFO L226 Difference]: Without dead ends: 200 [2023-11-06 22:08:58,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:08:58,139 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 146 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:58,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 461 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:08:58,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-06 22:08:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 150. [2023-11-06 22:08:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 93 states have internal predecessors, (127), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-06 22:08:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 235 transitions. [2023-11-06 22:08:58,171 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 235 transitions. Word has length 174 [2023-11-06 22:08:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:58,172 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 235 transitions. [2023-11-06 22:08:58,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-06 22:08:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 235 transitions. [2023-11-06 22:08:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-06 22:08:58,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:58,176 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:58,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:08:58,176 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:58,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:58,177 INFO L85 PathProgramCache]: Analyzing trace with hash 310686510, now seen corresponding path program 1 times [2023-11-06 22:08:58,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:58,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050521084] [2023-11-06 22:08:58,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:58,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:09:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:09:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:09:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:09:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:09:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:09:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:09:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:09:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:09:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:09:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:09:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:09:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:09:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:09:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:09:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:09:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:09:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:09:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:09:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:09:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 22:09:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:09:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-06 22:09:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-06 22:09:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 22:09:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-06 22:09:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-06 22:09:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-11-06 22:09:02,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:02,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050521084] [2023-11-06 22:09:02,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050521084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:09:02,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:09:02,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:09:02,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030420401] [2023-11-06 22:09:02,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:09:02,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:09:02,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:02,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:09:02,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:09:02,598 INFO L87 Difference]: Start difference. First operand 150 states and 235 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-06 22:09:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:03,066 INFO L93 Difference]: Finished difference Result 310 states and 478 transitions. [2023-11-06 22:09:03,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:09:03,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2023-11-06 22:09:03,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:03,071 INFO L225 Difference]: With dead ends: 310 [2023-11-06 22:09:03,071 INFO L226 Difference]: Without dead ends: 212 [2023-11-06 22:09:03,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:09:03,079 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 168 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:03,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 366 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:09:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-11-06 22:09:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 160. [2023-11-06 22:09:03,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-06 22:09:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 245 transitions. [2023-11-06 22:09:03,150 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 245 transitions. Word has length 175 [2023-11-06 22:09:03,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:03,152 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 245 transitions. [2023-11-06 22:09:03,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-11-06 22:09:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 245 transitions. [2023-11-06 22:09:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-06 22:09:03,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:03,155 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:03,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:09:03,156 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:09:03,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:03,156 INFO L85 PathProgramCache]: Analyzing trace with hash -82340500, now seen corresponding path program 1 times [2023-11-06 22:09:03,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:03,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179284472] [2023-11-06 22:09:03,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:09:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:09:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:09:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:09:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:09:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:09:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:09:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:09:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:09:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:09:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:09:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:09:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:09:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:09:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:09:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:09:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:09:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:09:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:09:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:09:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 22:09:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:09:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-06 22:09:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-06 22:09:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 22:09:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-06 22:09:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-06 22:09:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-11-06 22:09:03,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:09:03,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179284472] [2023-11-06 22:09:03,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179284472] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:09:03,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292189707] [2023-11-06 22:09:03,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:03,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:03,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:09:03,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:09:03,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:09:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:04,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:09:04,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:09:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2023-11-06 22:09:04,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:09:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-11-06 22:09:04,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292189707] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:09:04,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:09:04,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-11-06 22:09:04,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525591923] [2023-11-06 22:09:04,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:09:04,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:09:04,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:09:04,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:09:04,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:09:04,912 INFO L87 Difference]: Start difference. First operand 160 states and 245 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2023-11-06 22:09:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:09:05,267 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2023-11-06 22:09:05,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:09:05,268 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 175 [2023-11-06 22:09:05,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:09:05,270 INFO L225 Difference]: With dead ends: 266 [2023-11-06 22:09:05,271 INFO L226 Difference]: Without dead ends: 158 [2023-11-06 22:09:05,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 398 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:09:05,273 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 178 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:09:05,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 239 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:09:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-06 22:09:05,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2023-11-06 22:09:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 88 states have (on average 1.25) internal successors, (110), 88 states have internal predecessors, (110), 54 states have call successors, (54), 5 states have call predecessors, (54), 5 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-06 22:09:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2023-11-06 22:09:05,319 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 175 [2023-11-06 22:09:05,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:09:05,320 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2023-11-06 22:09:05,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2023-11-06 22:09:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2023-11-06 22:09:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-06 22:09:05,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:09:05,323 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:09:05,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:09:05,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33be0f30-73c0-4cfc-a4e2-1f8891e51418/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:09:05,531 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:09:05,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:09:05,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1945457343, now seen corresponding path program 1 times [2023-11-06 22:09:05,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:09:05,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723832887] [2023-11-06 22:09:05,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:09:05,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:09:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:09:24,550 WARN L293 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:09:41,040 WARN L293 SmtUtils]: Spent 9.04s on a formula simplification that was a NOOP. DAG size: 120 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:10:22,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:10:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:10:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:10:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:10:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:10:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:10:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:10:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:10:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:10:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:10:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:10:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:10:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:10:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:10:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:10:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:10:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:10:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:10:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:10:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:10:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 22:10:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:10:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-06 22:10:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-06 22:10:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 22:10:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-06 22:10:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-06 22:10:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-11-06 22:10:22,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:22,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723832887] [2023-11-06 22:10:22,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723832887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:22,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:22,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-06 22:10:22,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065671149] [2023-11-06 22:10:22,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:22,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 22:10:22,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:22,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:10:22,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:10:22,438 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2023-11-06 22:10:36,872 WARN L293 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 173 DAG size of output: 132 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:10:54,904 WARN L293 SmtUtils]: Spent 16.93s on a formula simplification. DAG size of input: 230 DAG size of output: 168 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:11:04,381 WARN L293 SmtUtils]: Spent 8.65s on a formula simplification. DAG size of input: 283 DAG size of output: 177 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:11:19,336 WARN L293 SmtUtils]: Spent 8.89s on a formula simplification. DAG size of input: 169 DAG size of output: 129 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:11:25,237 WARN L293 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 172 DAG size of output: 121 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:11:36,992 WARN L293 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 162 DAG size of output: 124 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:11:42,782 WARN L293 SmtUtils]: Spent 5.68s on a formula simplification. DAG size of input: 165 DAG size of output: 126 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:11:47,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:11:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:11:50,544 INFO L93 Difference]: Finished difference Result 502 states and 722 transitions. [2023-11-06 22:11:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-06 22:11:50,544 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 176 [2023-11-06 22:11:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:11:50,547 INFO L225 Difference]: With dead ends: 502 [2023-11-06 22:11:50,548 INFO L226 Difference]: Without dead ends: 410 [2023-11-06 22:11:50,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 106.8s TimeCoverageRelationStatistics Valid=403, Invalid=1237, Unknown=0, NotChecked=0, Total=1640 [2023-11-06 22:11:50,550 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 1280 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:11:50,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 1152 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2023-11-06 22:11:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2023-11-06 22:11:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 205. [2023-11-06 22:11:50,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 134 states have (on average 1.291044776119403) internal successors, (173), 135 states have internal predecessors, (173), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-06 22:11:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 293 transitions. [2023-11-06 22:11:50,638 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 293 transitions. Word has length 176 [2023-11-06 22:11:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:11:50,639 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 293 transitions. [2023-11-06 22:11:50,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2023-11-06 22:11:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 293 transitions. [2023-11-06 22:11:50,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-06 22:11:50,642 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:11:50,642 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:50,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:11:50,643 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:11:50,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1552430333, now seen corresponding path program 1 times [2023-11-06 22:11:50,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:50,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152596389] [2023-11-06 22:11:50,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:50,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat